Subscribe

Issue No.04 - April (2009 vol.20)

pp: 581-592

Sun-Yuan Hsieh , National Cheng Kung University, Tainan

Chia-Wei Lee , National Cheng Kung University, Tainan

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

ABSTRACT

A graph $G$ is called Hamiltonian if there is a Hamiltonian cycle in $G$. The conditional edge-fault Hamiltonicity of a Hamiltonian graph $G$ is the largest $k$ such that after removing $k$ faulty edges from $G$, provided that each node is incident to at least two fault-free edges, the resulting graph contains a Hamiltonian cycle. In this paper, we sketch common properties of a class of networks, called Matching Composition Networks (MCNs), such that the conditional edge-fault Hamiltonicity of MCNs can be determined from the found properties. We then apply our technical theorems to determine conditional edge-fault Hamiltonicities of several multiprocessor systems, including $n$-dimensional crossed cubes, $n$-dimensional twisted cubes, $n$-dimensional locally twisted cubes, $n$-dimensional generalized twisted cubes, and $n$-dimensional hyper Petersen networks. Moreover, we also demonstrate that our technical theorems can be applied to network construction.

INDEX TERMS

Graph Theory, Network problems, Path and circuit problems

CITATION

Sun-Yuan Hsieh, Chia-Wei Lee, "Conditional Edge-Fault Hamiltonicity of Matching Composition Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.20, no. 4, pp. 581-592, April 2009, doi:10.1109/TPDS.2008.123REFERENCES

- [1] S.G. Akl,
Parallel Computation: Models and Methods. Prentice Hall, 1997.- [2] N. Ascheuer, “Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing Systems,” PhD thesis, Univ. of Technology, ftp://ftp.zib.de/pub/zib-publications/reports TR-96-03.ps, 1995.
- [10] J.-S. Fu, “Fault-Free Hamiltonian Cycles in Twisted Cubes with Conditional Link Faults,”
Theoretical Computer Science, in press. - [11] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, “The Twisted Cube,”
Proc. Conf. Parallel Architectures and Languages Europe, Volume I: Parallel Architectures (PARLE '87), pp.152-159, 1987.- [12] T.-Y. Ho, J.J.M. Tan, and L.-H. Hsu, “Fault-Tolerant Hamiltonicity and Fault-Tolerant Hamiltonian Connectivity of the Folded Petersen Cube Networks,”
Int'l J. Computer Math., accepted. - [15] S.-Y. Hsieh and C.-D. Wu, “Conditional Edge-Fault-Tolerant Hamiltonian Cycle Embedding of Star Graphs,”
Proc. 13th Int'l Conf. Parallel and Distributed Systems (ICPADS), 2007.- [16] S.-Y. Hsieh and C.-Y. Wu, “Edge-Fault-Tolerant Hamiltonicity of Locally Twisted Cubes under Conditional Edge Faults,”
J.Combinatorial Optimization, in press. - [18] P.L. Lai and H.C. Hsu, “The Two-Equal-Disjoint Path Cover Problem of Matching Composition Network,”
Information Processing Letters, to appear. - [20] F.T. Leighton,
Introduction to Parallel Algorithms and Architecture: Arrays $\cdot$ Trees $\cdot$ Hypercubes. Morgan Kaufmann, 1992.- [21] J.-H. Park and K.-Y. Chwa, “Recursive Circulant: A New Topology for Multicomputer Networks,”
Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '94), pp. 73-80, 1994.- [22] J.-H. Park, H.-C. Kim, and H.-S. Lim, “Fault-Hamiltonicity of Hypercube-Like Interconnection Networks,”
Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), Apr. 2005.- [23] J.-H. Park, H.-C. Kim, and H.-S. Lim, “On the Construction of Paired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements,”
Proc. 10th Workshop Advances in Parallel and Distributed Computational Models (APDCM '08), to be presented, Apr. 2008. |