计算机工程与应用2016，Vol.52Issue(16)：41-45,5.DOI:10.3778/j.issn.1002-8331.1409-0336
相交双圈图的代数连通度的排序
Algebraic connectivity of intersectant bicycle graphs
摘要
Abstract
A simple connected graph is intersectant bicycle graph if the number of edges equals the number of vertices plus one and the two cycles in this graph at least two common vertex. This paper presents the fifth to tenth largest value of algebraic connectivity together with the corresponding graph.关键词
相交双圈图/拉普拉斯矩阵/代数连通度Key words
intersectant bicycle graph/Laplacian matrix/algebraic connectivity分类
社会科学引用本文复制引用
万继青,陈跃辉,康丽..相交双圈图的代数连通度的排序[J].计算机工程与应用,2016,52(16):41-45,5.基金项目
福建省研究生教育创新基地资助；闽南师范大学研究生科研立项（No.YJS201411）。 （）
