A subset SE(G) is called a 4-restricted-edge-cut of G
if G-S is disconnected and every component contains at least 4 vertices.The minimum cardinality over all 4-restricted-edge-cut of G is calledthe 4-restricted-edge connectivity of G
denoted by λ4(G).In this paper
we prove that λ4(Qn) = 4n-8.Similarly
a subset FV(G) is called a Rg-vertex cut of G
if GF is disconnected and each vertex u ∈V(G)-F has at least g neighbors in G-F.The minimum cardinality of all Rg-vertex-cut is called the Rg-vertex connectivity of G
Esfahanian A N.Generalized measures of fault tolerance with application to n-cube networks[J].IEEE Trans.Comput,1989,38(11):1586-1591.
Zhu Q,Xu J M.On the restricted edge connectivity and extra edge connectivity of hypercubes and folded-hypercubes[J].Journal of Univercity of Siciece and Techology of China,2006,36(3):249-253.
Yang W H,Meng J X.Extraconnectivity of Hypercubes[J].Applied mathmatics Letters,2009,22:887-891.
Latifi S,Hegde M,Naraghi-Pour M.Conditional connectivity Measures for Large Multiprocessor Systems[J].IEEE TransComput,2002,43(2):218-222.
Hellwig A,Rautenbach D,Volkmann L.Note on the connectivity of line graphs[J].Inform Process Lett,2004,91(1):7-10.
Meng J X.Superconnectivity and super edge-connectivity of line graphs[J].Graph Theory Notes of New York,2001,XL,12-14.
Bondy J A,Murty U S R.Graph theory with application[M].London:Macmillan,1976.
Xu J M,Lu Min,Meijie Ma and Angelika Hellwig.Super connectivity of line graph[J].Information Processing Letters,2005,94:191-195.
京公网安备11010802024621