On the Existence of Hamiltonian Circuits in Faulty Hypercubes
Authors:
- Mee Yee ChanMCMee Yee Chan
- Shiang-Jen LeeSLShiang-Jen Lee
- 1 November 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 4 (4) , 511-527
Abstract
The problem of finding Hamiltonian circuits in faulty hypercubes is explored. There are many different Hamiltonian circuits in a nonfaulty hypercube. The question of interest here is the following: if a certain number of links are removed from the hypercube, will a Hamiltonian circuit still exist? In partial answer to this question are the following results. First, it is shown that for any n-cube $( n\geqq 3 )$ with $\leqq 2n - 5$ link faults in which each node is incident to at least two nonfaulty links, there exists a Hamiltonian circuit consisting of only nonfaulty links. Since as will be shown, there exists an n-cube with $2n - 4$ faulty links, in which each node is incident to at least two nonfaulty links, for which there is no Hamiltonian circuit, this result is optimal. Second, it is shown that the problem of determining whether an n-cube with an arbitrary number of link faults has a Hamiltonian circuit is NP-complete.
Keywords
This publication has 6 references indexed in Scilit:
- Embedding of Grids into Optimal HypercubesSIAM Journal on Computing, 1991
- Fast Computation Using Faulty Hypercubes1989
- Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes1989
- Reconfiguring a hypercube in the presence of faults1987
- Optimal simulations of tree machines1986
- Embedding of tree networks into hypercubesJournal of Parallel and Distributed Computing, 1985