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


A note on the spectral characterization of dumbbell graphs
Authors:Jianfeng Wang  Qiongxiang Huang  Francesco Belardo  Enzo M Li Marzi  
Institution:aCollege of Mathematics and System Science, Xinjiang University, Urumqi 830046, PR China;bDepartment of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, PR China;cDepartment of Mathematics, University of Messina, 98166 Sant’Agata, Messina, Italy
Abstract:The dumbbell graph, denoted by Da,b,c, is a bicyclic graph consisting of two vertex-disjoint cycles Ca and Cb joined by a path Pc+3 (cgreater-or-equal, slanted-1) having only its end-vertices in common with the two cycles. By using a new cospectral invariant for (r,r+1)-almost regular graphs, we will show that almost all dumbbell graphs (without cycle C4 as a subgraph) are determined by the adjacency spectrum.
Keywords:Spectrum  Spectral radius  Cospectral graphs  Almost regular graphs
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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