首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Spectral characterization of line graphs of starlike trees
Authors:Jiang Zhou  Changjiang Bu
Institution:1. Department of Applied Mathematics, College of Science , Harbin Engineering University , Harbin 150001 , PR China zhoujiang04113112@163.com;3. Department of Applied Mathematics, College of Science , Harbin Engineering University , Harbin 150001 , PR China
Abstract: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.
Keywords:generalized line graph  cospectral graphs  adjacency matrix  signless Laplacian matrix  starlike tree
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号