摘要
边数等于点数加1的连通图称为双圈图.研究双圈图G的代数连通度,记作α(G),证明了结论:对所有的n(n≥10)阶双圈图G都有α(G)≤1成立,并且确定了满足α(G)=1的所有n(n≥10)阶双圈图.
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.
出处
《黑龙江大学自然科学学报》
CAS
北大核心
2007年第4期451-454,共4页
Journal of Natural Science of Heilongjiang University
基金
Supported by Natural Science Foundation of Shanghai Educational Committee(05EZ50)
