关于图的超常边连通度和等周边连通度的等值性  

On Equivalence of Isoperimetric Edge Connectivity and Extra Edge Connectivity of Graphs

作　　者：王铭[1] 李乔[1] 

机构地区：[1]上海交通大学数学系,上海200030

出　　处：《上海交通大学学报》2002年第6期858-860,共3页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目 (199710 5 6)

摘　　要：图的超常边连通度和等周边连通度都是图的通常边连通度概念的推广 .首先举例说明在一般情形下两者可以不等 ,然后再证明当正则边可迁图的阶不小于 3k时 ,它的 k阶超常边连通度与The k th extra edge connectivity and the k th isoperimetric edge connectivity generalize the concept of edge connectivity of a graph ( k ≥1). This paper showed by an example that generally the k th extra edge connectivity of a graph is not equal to its k th isoperimetric edge connectivity. It also proved that if a regular edge transitive graph has order at least 3 k , then its k th extra edge connectivity and k th isoperi metric edge connectivity are equal.

关 键 词：等值性 超常边连通度 等周边连通度 正则边可迁图 图论 有向图 

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