Spectral characterization of graphs with index at most 2+5
Spectral characterization of graphs with index at most 2+5
复制标题
DOI：
10.1016/j.laa.2006.08.009
复制
发表时间：
2007-01
影响因子：
1.1
通讯作者：
N. Ghareghani;G. Omidi;B. Tayfeh-Rezaie
中科院分区：
文献类型：
--
作者：
N. Ghareghani;G. Omidi;B. Tayfeh-Rezaie
如果不存在具有相同谱的非同构图，则称一个图由邻接谱决定。所有指数至多为2+5的连通图都是已知的。在本文中，我们表明，除了少数例外，所有这些图是DS。
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.