Back to Search
Start Over
Component connectivity of the hypercubes.
- Source :
- International Journal of Computer Mathematics; Jan2012, Vol. 89 Issue 2, p137-145, 9p
- Publication Year :
- 2012
-
Abstract
- 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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00207160
- Volume :
- 89
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- International Journal of Computer Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 69732807
- Full Text :
- https://doi.org/10.1080/00207160.2011.638978