On reliability of the folded hypercubes q

Abstract

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… (More)

Topics

1 Figure or Table

Slides referencing similar topics