论文信息 - Component connectivity of the hypercubes

Component connectivity of the hypercubes

The r-component connectivity κ r (G) of the non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. So, κ2 is the usual connectivity. In this paper, we determine the r-component connectivity of the hypercube Q n for r=2, 3, …, n+1, and we classify all the corresponding optimal solutions.

[1] David J. Evans,et al. On the maximal connected component of a hypercube with faulty vertices III , 2006, Int. J. Comput. Math..

[2] Hong-Jian Lai,et al. On the maximal connected component of hypercube with faulty vertices , 2004, Int. J. Comput. Math..

[3] Ortrud R. Oellermann,et al. Generalized Connectivity in Graphs , 1986 .

[4] S. Lakshmivarahan,et al. A new class of interconnection networks based on the alternating group , 1993, Networks.

[5] David J. Evans,et al. On the maximal connected component of hypercube with faulty vertices (II) , 2004, Int. J. Comput. Math..

[6] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[7] Eddie Cheng,et al. Linearly many faults in Cayley graphs generated by transposition trees , 2007, Inf. Sci..

[8] Eddie Cheng,et al. Linearly many faults in 2‐tree‐generated networks , 2010, Networks.