无爪图的谱半径与可迹性  

Spectral Radius and Traceability of Claw-Free Connected Graphs

作　　者：谢兆丰[1] 周甫[1] 叶淼林[1] 

机构地区：[1]安庆师范学院数学与计算科学学院,安徽安庆246133

出　　处：《安庆师范学院学报（自然科学版）》2016年第1期8-9,57,共3页Journal of Anqing Teachers College(Natural Science Edition)

基　　金：安徽省自然科学基金(11040606M14)

摘　　要：针对无爪图,将谱半径与稳定性相结合,得出了其关于可迹性判定的两个结论。此结论又利用图与补图的谱半径分别刻画无爪连通图是可迹图的充分条件,并利用一系列引理及代数方法加以证明,部分结论优于前人的成果。In this paper,two conclusions are obtained for the determination of the traceability of the claw-free graph,by the way of combining the method of spectral radius and stability. These conclusions are described as the sufficient condition of clawfree connected graph by the spectral radius of graph and complementary graph. Some lemmas are used to prove them,and some conclusions are better than the previous ones.

关 键 词：代数图论 可迹性 谱半径 无爪图 

分 类 号：O157[理学—数学]