| 相离双圈图的代数连通度 |
| |
| 引用本文： | 万继青,康丽.相离双圈图的代数连通度[J].漳州师院学报,2014(3):13-22. |
| |
| 作者姓名： | 万继青 康丽 |
| |
| 作者单位： | 闽南师范大学数学与统计学院,福建漳州363000 |
| |
| 基金项目： | 闽南师范大学研究生科研立项（YJS201411） |
| |
| 摘 要： | 简单连通图若边数等于顶点数加1,且图中所含的两个圈没有公共顶点,则称该图为相离双圈图.本文主要给出了相离双圈图中前十四大代数连通度的图类.
|
| 关 键 词： | 相离双圈图 拉普拉斯矩阵 代数连通度 |
The Algebraic Connectivity of Disjoint Bicycle Graphs |
| |
| WAN Ji-qing,KANG Li.The Algebraic Connectivity of Disjoint Bicycle Graphs[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2014(3):13-22. |
| |
| Authors: | WAN Ji-qing KANG Li |
| |
| Institution: | (School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian 363000, China) |
| |
| Abstract: | A simple connected graph is disjoint bicycle graph if the numble of edges equals the numble of vertices plus one and the two cycles in this graph have no common vertex. In this paper, we present the first to fourteenth largest value of algebraic connectivity together with the corresponding graph. |
| |
| Keywords: | disjoint bicycle graph laplacian matrix algebraic connectivity |
| 本文献已被 维普 等数据库收录！ |
|
