| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603787 | Linear Algebra and its Applications | 2007 | 7 Pages |
Abstract
A graph is said to be determined by the adjacency spectrum (DS for short) if there is no other nonisomorphic graph with the same spectrum. All connected graphs with index at most are known. In this paper, we show that with few exceptions all of these graphs are DS.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
