图的代数连通度及其点连通度  

The Algebraic and Vertex Connectivity of Graphs

作　　者：肖恩利[1] 束金龙[1] 闻人凯[1] 

机构地区：[1]华东师范大学数学系,上海200062

出　　处：《华东师范大学学报（自然科学版）》2003年第4期1-4,共4页Journal of East China Normal University(Natural Science)

基　　金：国家自然科学基金(19971027;10271048)

摘　　要：G是一个简单图。a(G),k(G)分别为G的代数连通度和点连通度,该文刻画了满足a(G)=k(G)的图。G=(V,E)是一个n阶简单图,点连通度为k(G)≤n2。H是G的任一最小点割集,则a(G)=k(G)当且仅当对任意u∈H和v∈V\H,有uv∈E。G is a simple graph with a(G) and k(G) , its algebraic and vertex connectivity. This paper finds all the graphs satisfying a(G)=k(G): G=(V,E) is a simple graph of order n with vertex connectivity k(G)≤n2 , and H is one of G' s minimal vertex cut set, then a(G)=k(G) holds if and only if for every u∈H and every v∈V\H, uv∈E.

关 键 词：LAPLACE矩阵 代数连通度 点连通度 线图 

分 类 号：O157.5[理学—数学]