The Laplacian Spectrum of a Graph

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 0-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.