This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hamiltonicity of Product Networks with Faulty Elements
PrePrint
ISSN: 1045-9219
Chia-Wei Lee, National Cheng Kung University, Tainan
Tsong-Jie Lin, Nan-Jeon Institute of Technology, Yan-Hsui
Sun-Yuan Hsieh, National Cheng Kung University, Tainan
\begin{abstract A graph G is k-fault Hamiltonian (resp. Hamiltonian-connected) if after deleting at most k vertices and/or edges from G, the resulting graph remains Hamiltonian (resp. Hamiltonian-connected). Let δi be the minimum degree of G i for i=0,1. Given (δi-2)-fault Hamiltonian and (δi-3)-fault Hamiltonian-connected graph G i for i=0,1, this study shows that the Cartesian product network G 0\times G 1 is (δ0+δ1-2)-fault Hamiltonian and (δ0+δ1-3)-fault Hamiltonian-connected. We then apply the result to determine the fault-tolerant Hamiltonicity and Hamiltonian-connectivity of two multiprocessor systems, namely the generalized hypercube and the nearest neighbor mesh hypercube, both of which belong to Cartesian product networks. This study also demonstrates that these results are worst-case optimal with respect to the number of faults tolerated.
Index Terms:
Path and circuit problems,Mathematics of Computing,Discrete Mathematics,Graph Theory,Network problems
Citation:
Chia-Wei Lee, Tsong-Jie Lin, Sun-Yuan Hsieh, "Hamiltonicity of Product Networks with Faulty Elements," IEEE Transactions on Parallel and Distributed Systems, 29 May 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.103>
Usage of this product signifies your acceptance of the Terms of Use.