1 research outputs found
Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater than 2. We prove that all these graphs are determined by the spectrum of their Laplacian matrix, and that all these graphs except the star on four vertices are determined by the spectrum of their signless Laplacian matrix