### Abstract

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 language | English |
---|---|

Pages (from-to) | 63-69 |

Number of pages | 7 |

Journal | Theoretical Computer Science |

Volume | 443 |

DOIs | |

Publication status | Published - 2012 Jul 20 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

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

## Cite this

Hsieh, S. Y., & Chang, Y. H. (2012). Extraconnectivity of k-ary n-cube networks.

*Theoretical Computer Science*,*443*, 63-69. https://doi.org/10.1016/j.tcs.2012.03.030