The Laplacian spectrum of a graph

Authors:
K. Ch. Das
Affiliations:
-
Venue:
Computers & Mathematics with Applications
Year:
2004

Citing 1
Cited 6

The Laplacian Spectrum of a Graph II

SIAM Journal on Discrete Mathematics

Smith normal form and Laplacians

Journal of Combinatorial Theory Series B
Algebraic connectivity optimization via link addition

Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Which wheel graphs are determined by their Laplacian spectra?

Computers & Mathematics with Applications
Bounds on the index of the signless Laplacian of a graph

Discrete Applied Mathematics
Some results on the Laplacian spectrum

Computers & Mathematics with Applications
Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

Let G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertexdegrees and by A(G) its adjacency matrix. Then, the Laplacian matrix of G is L(G) = D(G) - A(G). The first and second section of this paper contains introduction and some known results, respectively. The third section is devoted to properties of Laplacian spectrum. The fourth section contains characterization of graphs. The fifth section relates the Laplacian eigenvalues with the graph structure.