On a Laplacian spectral characterization
โ
G.R. Omidi
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 129 KB
A graph is said to be determined by the adjacency (respectively, Laplacian) spectrum if there is no other non-isomorphic graph with the same adjacency (respectively, Laplacian) spectrum. The maximum eigenvalue of A(G) is called the index of G. The connected graphs with index less than 2 are known, a