安庆师范学院学报（自然科学版）Issue(1)：8-9,57,3.DOI:10.13757/j.cnki.cn34-1150/n.2016.01.003
无爪图的谱半径与可迹性
Spectral Radius and Traceability of Claw-Free Connected Graphs
摘要
Abstract
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 claw-free 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.关键词
代数图论/可迹性/谱半径/无爪图Key words
Algebraic graph theory/traceability/spectral radius/claw-free graph分类
数理科学引用本文复制引用
谢兆丰,周甫,叶淼林..无爪图的谱半径与可迹性[J].安庆师范学院学报（自然科学版）,2016,(1):8-9,57,3.基金项目
安徽省自然科学基金（11040606M14）。 （）
