| 双圈图的代数连通度 |
| |
| 引用本文： | 袁西英,张丽,孙玉芹.双圈图的代数连通度[J].黑龙江大学自然科学学报,2007,24(4):451-454. |
| |
| 作者姓名： | 袁西英 张丽 孙玉芹 |
| |
| 作者单位： | 同济大学数学系,上海,200092 |
| |
| 基金项目： | Supported by Natural Science Foundation of Shanghai Educational Committee(05EZ50) |
| |
| 摘 要： | 边数等于点数加1的连通图称为双圈图.研究双圈图G的代数连通度,记作α(G),证明了结论:对所有的n(n≥10)阶双圈图G都有α(G)≤1成立,并且确定了满足α(G)=1的所有n(n≥10)阶双圈图.
|
| 关 键 词： | 双圈图 Laplacian矩阵 代数连通度 |
| 文章编号： | 1001-7011(2007)04-0451-04 |
| 修稿时间： | 2006年11月27 |
On the algebraic connectivity of bicyclic graphs |
| |
| Yuan Xiying,Zhang Li,Sun Yuqin.On the algebraic connectivity of bicyclic graphs[J].Journal of Natural Science of Heilongjiang University,2007,24(4):451-454. |
| |
| Authors: | Yuan Xiying Zhang Li Sun Yuqin |
| |
| Abstract: | Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one.The aothors study the algebraic connectivity α(G)of a bicyclic graph G on n vertices and prove that α(G)≤1 for all bicyclic graphs G on n(n≥10)vertices.Funhermore they determine all the bicyclic graphs G on n(,n≥10)vertices such that α(G)=1. |
| |
| Keywords: | Bicyclic graphs Laplacian matrix Algebraic connectivity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
