Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435182 | Theoretical Computer Science | 2016 | 4 Pages |
Abstract
The r -component connectivity cκr(G)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(Qn)=−r22+(2n−52)r−n2+2n+1 for n+1≤r≤2n−5n+1≤r≤2n−5, n≥6n≥6. This paper extends the results in Hsu et al. (2012) [3].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shuli Zhao, Weihua Yang, Shurong Zhang,