Spectral characterization of line graphs of starlike trees
Spectral characterization of line graphs of starlike trees
复制标题
DOI：
10.1080/03081087.2012.733386
复制
发表时间：
2013-07
影响因子：
1.1
通讯作者：
Jiang Zhou;Changjiang Bu
中科院分区：
文献类型：
--
作者：
Jiang Zhou;Changjiang Bu
如果两个图具有相同的邻接谱，则称它们为a -共谱。如果不存在与G同谱的非同构图A，则称图G由其邻接谱决定。如果树只有一个顶点的度数大于2，则称之为星形树。在本文中，我们证明了最大度至少为12的星形树的线形图是由它们的邻接谱决定的。
Two graphs are said to be A-cospectral if they have the same adjacency spectrum. A graph G is said to be determined by its adjacency spectrum if there is no other non-isomorphic graph A-cospectral with G. A tree is called starlike if it has exactly one vertex of degree greater than 2. In this article, we prove that the line graphs of starlike trees with maximum degree at least 12 are determined by their adjacency spectra.