loading...
Pancyclicity on M?bius Cubes with Edge Faults
Hong Kong, SAR, China May 10-May 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.13004762004 International Symposium on Paral ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sun-Yuan Hsieh, National Cheng Kung University, Taiwan
Chun-Hua Chen, National Cheng Kung University, Taiwan
A graph G = (V, E) is said to be pancyclic if it contains cycles of all lengths from 4 to |4| in G. Let F{e} be the set of faulty edges. In this paper, we show that an n-dimensional M?bius cube, n ≥ 1, contains a fault-free Hamiltonian path when |F{e}| ≤ n -1. We also show that an n-dimensional M?bius cube, n ≥ 2, is pancyclic when |F{e}| ≤ n - 2. Since an n-dimensional M?bius cube is regular of degree n, both results are optimal in the worst case.
Citation:
Sun-Yuan Hsieh, Chun-Hua Chen, "Pancyclicity on M?bius Cubes with Edge Faults," ispan, pp.168, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.