“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 8332 |
|
||||||
| 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
√{2√5} are known. In this paper, we show that with few
exceptions all of these graphs are DS.
Download TeX format |
|||||||
| back to top | |||||||
