超立方体网络的限制边连通性  

Restricted Edge Connectivity of Hypercube Networks

作　　者：刘芳[1] 欧见平[1] 

机构地区：[1]五邑大学数学与计算机科学学院,广东江门529020

出　　处：《五邑大学学报（自然科学版）》2012年第3期1-5,共5页Journal of Wuyi University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(11126326)

摘　　要：m-限制边割将连通图分离成阶不小于m的连通分支,图G的最小m-限制边割所含的边数称为图的m-限制边连通度.本文给出了n立方体的m-限制边连通度的表达式,由此推出:当m≤2(n/2)-1或m=2 k≤2n-1(k为任意正整数)时,超立方体Qn是极大m-限制边连通的.An edge cut of a connected graph is m-restricted if its removal separates this graph from all components of an order not less than;the minimum size m-restricted edge cut of this graph is called its restricted edge connectivity.By presenting explicit expressions of the m-restricted edge connectivity of hypercube networks,this paper shows that n-cube Qn is maximally m-restricted edge connected for every integer m≤2（n/2）-1 or m=2 k≤2n-1,where k is an arbitrary positive integer.

关 键 词：超立方体 限制边连通度 网络可靠性 

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