On reliability of the folded hypercubes

In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n P 5. That is, for n P 8 (resp. n P 5), at least 3n À 2 vertices (resp. 3n À 1 edges) of FQn are removed to get a disconnected graph that contains no isolated vertices (resp. edges). When the folded hypercube is used to model the topological structure of a large-scale parallel processing system, these results can provide more accurate measurements for reliability and fault tolerance of the system. Ó 2006 Elsevier Inc. All rights reserved.

• Type: Journal
• Year: 2007
• Where: ISCI
• Authors: Qiang Zhu 0003, Jun-Ming Xu, Xinmin Hou, Min Xu
• Keywords: 2-extra Connectivity, Folded Hypercube, Folded Hypercube Fqn, ISCI 2007