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.
No takes yet. Share an insight, caveat, or question.
Hsu et al. (2011) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: