Extraconnectivity of k-ary n-cube networks

Sun Yuan Hsieh; Ying Hsuan Chang

doi:10.1016/j.tcs.2012.03.030

Extraconnectivity of k-ary n-cube networks

Sun Yuan Hsieh, Ying Hsuan Chang

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Article

63 Citations (Scopus)

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	https://doi.org/10.1016/j.tcs.2012.03.030
Publication status	Published - 2012 Jul 20

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2012.03.030

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

@article{d4c0188a4fb74027b075082020274e3b,

title = "Extraconnectivity of k-ary n-cube networks",

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.",

author = "Hsieh, {Sun Yuan} and Chang, {Ying Hsuan}",

year = "2012",

month = jul,

day = "20",

doi = "10.1016/j.tcs.2012.03.030",

language = "English",

volume = "443",

pages = "63--69",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Extraconnectivity of k-ary n-cube networks

AU - Hsieh, Sun Yuan

AU - Chang, Ying Hsuan

PY - 2012/7/20

Y1 - 2012/7/20

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84861802497&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861802497&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2012.03.030

DO - 10.1016/j.tcs.2012.03.030

M3 - Article

AN - SCOPUS:84861802497

VL - 443

SP - 63

EP - 69

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -