ISSN: 1045-9219

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.103

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

ABSTRACT

\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 &#x03B4;i be the minimum degree of G i for i=0,1. Given (&#x03B4;i-2)-fault Hamiltonian and (&#x03B4;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 (&#x03B4;0+&#x03B4;1-2)-fault Hamiltonian and (&#x03B4;0+&#x03B4;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

S. Hsieh, T. Lin and C. Lee, "Hamiltonicity of Product Networks with Faulty Elements," in

*IEEE Transactions on Parallel & Distributed Systems*.

doi:10.1109/TPDS.2013.103

CITATIONS