By Topic

Pancyclicity on Mobius cubes with edge faults

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)
Sun-Yuan Hsieh ; Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Chun-Hua Chen

A graph G = (V, E) is said to be pancyclic if it contains cycles of all lengths from 4 to |V| in G. Let Fe be the set of faulty edges. In this paper, we show that an n-dimensional Mobius cube, n ≥ 1, contains a fault-free Hamiltonian path when |Fe| ≤ n-1. We also show that an n-dimensional Mobius cube, n ≥ 2, is pancyclic when |Fe| ≤ n-2. Since an n-dimensional Mobius cube is regular of degree n, both results are optimal in the worst case.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004