Y. Li, S. Peng, and W. Chu (Japan)
Interconnection network, hypercube, fault-tolerant embed ding, hamiltonian cycle
In this paper, we show that given a binary n-cube with fe n-2 and fe + fv 2n-4, where fe and fv are the numbers of faulty links and faulty nodes, respectively, there exists a fault-free cycle of length at least 2n - 2 fv. This result is better than any previous results in the literature.
Important Links:
Go Back