计算机工程与应用 ›› 2016, Vol. 52 ›› Issue (16): 41-45.
• 理论与研发 • 上一篇 下一篇
万继青，陈跃辉，康 丽
出版日期:
发布日期:
WAN Jiqing, CHEN Yuehui, KANG Li
Online:
Published:
摘要： 简单连通图若边数等于顶点数加1，且图中所含的两个圈至少有两个公共顶点，则称该图为相交双圈图。主要给出了相交双圈图中第五到第十大代数连通度的图类。
关键词: 相交双圈图, 拉普拉斯矩阵, 代数连通度
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.
WAN Jiqing, CHEN Yuehui, KANG Li. Algebraic connectivity of intersectant bicycle graphs[J]. Computer Engineering and Applications, 2016, 52(16): 41-45.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2016/V52/I16/41
