CAJ | 학술논문

m-限制边割将连通图分离成阶不小于m的连通分支,图G的最小m-限制边割所含的边数称为图的m-限制边连通度.本文给出了n立方体的m-限制边连通度的表达式,由此推出：当m≤2（n/2）-1或m=2 k≤2n-1（k为任意正整数）时,超立方体Qn是极大m-限制边连通的.
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.