The Laplacian spectrum of a graph

Grone, Robert ; Merris, Russell ; Sunder, V. S. (1990) The Laplacian spectrum of a graph SIAM Journal on Matrix Analysis and Applications, 11 (2). pp. 218-238. ISSN 0895-4798

Full text not available from this repository.

Official URL:

Related URL:


Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of vertex degrees and the O-1 adjacency matrix. Various aspects of the spectrum of L (G) are investigated. Particular attention is given to multiplicities of integer eigenvalues and to the effect on the spectrum of various modifications of G.

Item Type:Article
Source:Copyright of this article belongs to Society for Industrial and Applied Mathematics.
Keywords:Tree(s); Eigenvalue(s); Spectra; Graph(s)
ID Code:53535
Deposited On:09 Aug 2011 11:48
Last Modified:11 Aug 2011 11:22

Repository Staff Only: item control page