Component connectivity of hypercubes.

The r-component connectivity c ź r ( G ) of a non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. In this paper, we determine the component connectivity of the hypercube c ź r + 1 ( Q n ) = - r 2 2 + ( 2 n - 5 2 ) r - n 2 + 2 n + 1 for n + 1 ź r ź 2 n - 5 , n ź 6 . This paper extends the results in Hsu et al. (2012) 3.