Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4603278 | Linear Algebra and its Applications | 2008 | 8 Pages |
Abstract
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, and each is determined by its adjacency spectrum. In this paper, we show that graphs of index less than 2 are determined by their Laplacian spectrum.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory