Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes
by Che-Nan Kuo; Chia-Wei Lee; Nai-Wen Chang; Kuang-Husn Shih
International Journal of Mobile Communications (IJMC), Vol. 12, No. 4, 2014

Abstract: The folded hypercube (FQn for short) is a well-known variation of hypercube structure and can be constructed from a hypercube by adding a link to every pair of vertices with complementary addresses. FQn for any odd n is known to be bipartite. Let f be a faulty vertex in FQn, for n ≥ 2. In addition, let u and v be any two fault-free vertices in FQn − {f}. It has been shown that: 1) FQn − {f} contains a fault-free path P[u, v] of every length l with dFQn(u, v) + 2 ≤ l ≤ 2n − 3 and 2|l − dFQn (u, v), where n ≥ 2; 2) FQn − {f} contains a fault-free P[u, v] path of every length l with n − 1 ≤ l ≤ 2n − 3, where n ≥ 2 is even. In this paper, we extend the above-mentioned result to obtain two further properties as follows: 1) FQn − {f} contains a fault-free path P[u, v] of every length l with dFQn(u, v) ≤ l ≤ 2n − 3 and 2|l − dFQn(u, v) for n ≥ 2; 2) FQn − {f} contains a fault-free path P[u, v] of every length l with n − 1 ≤ l ≤ 2n − 2 for n ≥ 2 is even.

Online publication date: Thu, 30-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com