Component connectivity of the hypercubes

Lih Hsing Hsu, Eddie Cheng, Liptak Laszlo, Jiann-Mean Tan, Cheng-Kuan Lin, Tung-Yang Ho

Research output: Contribution to journalArticlepeer-review

43 Scopus citations


The r-component connectivity kappa(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, kappa(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.
Original languageEnglish
Pages (from-to)137-145
Number of pages9
JournalInternational Journal of Computer Mathematics
Issue number2
StatePublished - 2012


  • hypercubes; component connectivity

Fingerprint Dive into the research topics of 'Component connectivity of the hypercubes'. Together they form a unique fingerprint.

Cite this