The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2007)
Hsinchu, Taiwan
Dec. 5, 2007 to Dec. 7, 2007
ISBN: 978-1-4244-1889-3
pp: 1-8
null Chang-De Wu , National Cheng Kung University, Department of Computer Science and Information Engineering, No. 1, University Road, Tainan 70101, TAIWAN
null Sun-Yuan Hsieh , National Cheng Kung University, Department of Computer Science and Information Engineering, No. 1, University Road, Tainan 70101, TAIWAN
null Chao-Wen Huang , National Cheng Kung University, Department of Computer Science and Information Engineering, No. 1, University Road, Tainan 70101, TAIWAN
ABSTRACT
The star graph has been recognized as an attractive alternative to the hypercube. In this paper, we investigate the hamiltoncity of a n-dimensional star graph. We show that for any n-dimensional star graph (n ≥ 4) with at most 3n − 10 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free Hamiltonian cycle. Our result improves the previously best known result where the number of tolerable faulty edges is bounded by 2n − 7. We also demonstrate that our result is optimal with respect to the worst case scenario where every other node of a six-length cycle is incident to exactly n − 3 faulty non-cycle edges.
INDEX TERMS
null
CITATION
null Chang-De Wu, null Sun-Yuan Hsieh, null Chao-Wen Huang, "Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs", Parallel and Distributed Systems, International Conference on, vol. 01, no. , pp. 1-8, 2007, doi:10.1109/ICPADS.2007.4447776
96 ms
(Ver )