Spectral characterizations of lollipop graphs
Spectral characterizations of lollipop graphs
复制标题
DOI:
10.1016/j.laa.2007.10.018
复制
发表时间:
2008-06
影响因子:
1.1
通讯作者:
W. Haemers;Xiaogang Liu;Yuanping Zhang
中科院分区:
文献类型:
--
作者:
W. Haemers;Xiaogang Liu;Yuanping Zhang
The lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cpto a pendant vertex of a path Pn-p. We will show that no two non-isomorphic lollipop graphs are cospectral with respect to the adjacency matrix. It is proved that for p odd the lollipop graphs Hn,pand some related graphs Hn,p′are determined by the adjacency spectrum, and that all lollipop graphs are determined by its Laplacian spectrum.