1 January 2012 in International Journal of Computer Mathematics
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 November 2007 in Information Sciences
29 March 2009 in Information Sciences
1 March 2008 in Journal of Interconnection Networks
1 September 2012 in Discrete Applied Mathematics