By Topic

Cycles in conditional faulty enhanced hypercube networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Min Liu ; Coll. of Sci., China Three Gorges Univ., Yichang, China ; Hongmei Liu

The architecture of an interconnection network is usually represented by a graph, and a graph G is bipancyclic if it contains a cycle for every even length from 4 to |V(G)|. In this article, we analyze the conditional edge-fault-tolerant properties of an enhanced hypercube, which is an attractive variant of a hypercube that can be obtained by adding some complementary edges. For any n-dimensional enhanced hypercube with at most (2n-3) faulty edges in which each vertex is incident with at least two fault-free edges, we showed that there exists a fault-free cycle for every even length from 4 to 2n when n (n ≥ 3) and k have the same parity. We also show that a fault-free cycle for every odd length exists from n-k+2 to 2n-1 when n (n ≥ 2) and k have the different parity.

Published in:

Communications and Networks, Journal of  (Volume:14 ,  Issue: 2 )