Hamiltonicity of Matching Composition Networks with Conditional Edge Faults
- Cite this paper as:
- Hsieh SY., Lee CW. (2008) Hamiltonicity of Matching Composition Networks with Conditional Edge Faults. In: Agrawal M., Du D., Duan Z., Li A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg
In this paper, we sketch structure characterization of a class of networks, called Matching Composition Networks (MCNs), to establish necessary conditions for determining the conditional fault hamiltonicity. We then apply our result to n-dimensional restricted hypercube-like networks, including n-dimensional crossed cubes, and n-dimensional locally twisted cubes, to show that there exists a fault-free Hamiltonian cycle if there are at most 2n − 5 faulty edges in which each node is incident to at least two fault-free edges. We also demonstrate that our result is worst-case optimal with respect to the number of faulty edges tolerated.
KeywordsAlgorithmica aspect of network problems conditional edge faults fault-tolerance graph theory Hamiltonian cycles Hamiltonicity matching composition networks multiprocessor systems restricted hypercube-like networks
Unable to display preview. Download preview PDF.