| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 394935 | Information Sciences | 2011 | 8 Pages |
Abstract
The dual-cube is an interconnection network for linking a large number of nodes with a low node degree. It uses low-dimensional hypercubes as building blocks and keeps the main desired properties of the hypercube. A dual-cube DC(n) has n + 1 links per node where n is the degree of a cluster (n-cube), and one more link is used for connecting to a node in another cluster. In this paper, assuming each node is incident with at least two fault-free links, we show a dual-cube DC(n) contains a fault-free Hamiltonian cycle, even if it has up to 2n − 3 link faults. The result is optimal with respect to the number of tolerant edge faults.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jheng-Cheng Chen, Chang-Hsiung Tsai,