TY - JOUR

T1 - R3-connectivity of folded hypercubes

AU - Lee, Chia Wei

AU - Hsieh, Sun Yuan

AU - Yang, Shuen Shiang

N1 - Funding Information:
This work of C.-W. Lee was supported by the Ministry of Science and Technology of Taiwan under Grant MOST 108-2221-E-143-004-MY2 .
Publisher Copyright:
© 2020 Elsevier B.V.

PY - 2020/10/15

Y1 - 2020/10/15

N2 - Given a graph G=(V,E), where V is the node set and E is the edge set of G, and a non-negative integer h, the h-restricted connectivity of G is the minimum size of a set of nodes X of G, where X⊂V(G), such that G[V−X] is disconnected and each node in the remaining graph has at least h neighbors, denoted by κh(G). Folded hypercube FQ is a well-known network topology. An n-dimensional folded hypercube FQn can be obtained from an n-dimensional hypercube by adding a specific perfect matching. In this paper, we show that 3-restricted connectivity of n-dimensional folded hypercube is 8n−16 for n≥6.

AB - Given a graph G=(V,E), where V is the node set and E is the edge set of G, and a non-negative integer h, the h-restricted connectivity of G is the minimum size of a set of nodes X of G, where X⊂V(G), such that G[V−X] is disconnected and each node in the remaining graph has at least h neighbors, denoted by κh(G). Folded hypercube FQ is a well-known network topology. An n-dimensional folded hypercube FQn can be obtained from an n-dimensional hypercube by adding a specific perfect matching. In this paper, we show that 3-restricted connectivity of n-dimensional folded hypercube is 8n−16 for n≥6.

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

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

U2 - 10.1016/j.dam.2020.04.030

DO - 10.1016/j.dam.2020.04.030

M3 - Article

AN - SCOPUS:85088020113

VL - 285

SP - 261

EP - 273

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -