Extraconnectivity of k-ary n-cube networks

Sun Yuan Hsieh, Ying Hsuan Chang

Research output: Contribution to journalArticlepeer-review

81 Citations (Scopus)


Given a graph G and a non-negative integer g, the g-extraconnectivity of G is the minimum cardinality of a set of vertices in G, if such a set exists, whose deletion disconnects G and leaves every remaining component with more than g vertices. This study shows that the 2-extraconnectivity of a k-ary n-cube Qnk for k<4 and n<5 is equal to 6n-5.

Original languageEnglish
Pages (from-to)63-69
Number of pages7
JournalTheoretical Computer Science
Publication statusPublished - 2012 Jul 20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Extraconnectivity of k-ary n-cube networks'. Together they form a unique fingerprint.

Cite this