Laplace Spectra of Orgraphs and Their Applications
Automation and Remote Control
The Laplacian spectral radius of a graph under perturbation
Computers & Mathematics with Applications
Laplacian spectral bounds for clique and independence numbers of graphs
Journal of Combinatorial Theory Series B
Average consensus problems in networks of agents with delayed communications
Automatica (Journal of IFAC)
Some results on the ordering of the Laplacian spectral radii of unicyclic graphs
Discrete Applied Mathematics
The Laplacian spectrum of a graph
Computers & Mathematics with Applications
Computing the Laplacian spectra of some graphs
Discrete Applied Mathematics
Note: A majorization method for localizing graph topological indices
Discrete Applied Mathematics
The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Let G be a graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then L(G) = D(G) - A(G) is the Laplacian matrix of G. The first section of this paper is devoted to properties of Laplacian integral graphs, those for which the Laplacian spectrum consists entirely of integers. The second section relates the degree sequence and the Laplacian spectrum through majorization. The third section introduces the notion of a d-cluster, using it to bound the multiplicity of d in the spectrum of L(G).