TY - JOUR

T1 - Fault-tolerant bipancyclicity of faulty hypercubes under the generalized conditional-fault model

AU - Chang, Nai Wen

AU - Hsieh, Sun Yuan

PY - 2011/12

Y1 - 2011/12

N2 - Let F v be a set of faulty nodes in an n-dimensional hypercube, denoted by Q n. Also, let F e be a set of faulty edges in which at least one end-node of each edge is faulty. An edge in Q n is said to be critical if it is either fault-free or in F e. In this paper, we prove that, for up to 2n-4 faulty nodes and/or edges, an n-dimensional hypercube contains a fault-free cycle of every even length from 4 to 2 n-2|F v| in which each node is incident to at least two critical edges. Our result improves on the previously best known results reported in the literature.

AB - Let F v be a set of faulty nodes in an n-dimensional hypercube, denoted by Q n. Also, let F e be a set of faulty edges in which at least one end-node of each edge is faulty. An edge in Q n is said to be critical if it is either fault-free or in F e. In this paper, we prove that, for up to 2n-4 faulty nodes and/or edges, an n-dimensional hypercube contains a fault-free cycle of every even length from 4 to 2 n-2|F v| in which each node is incident to at least two critical edges. Our result improves on the previously best known results reported in the literature.

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

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

U2 - 10.1109/TCOMM.2011.093011.100321

DO - 10.1109/TCOMM.2011.093011.100321

M3 - Article

AN - SCOPUS:84655160886

SN - 0090-6778

VL - 59

SP - 3400

EP - 3409

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 12

M1 - 6042300

ER -