Name
Abstract | ||
|---|---|---|
A hierarchical cubic network was proposed as an alternative to the hypercube. By HCN(n), we denote the hierarchical cubic network that contains 2n n-dimensional hypercubes. In this paper, using Gray codes, we construct fault-free Hamiltonian cycles in an HCN(n) with n - 1 link faults. Since the HCN(n) is regular of degree n + 1, the result is optimal. We also construct longest fault-free cycles of length 22n - 1 in an HCN(n) with a one-node fault and fault-free cycles of length at least 22n - 2f in an HCN(n) with f-node faults, where 22n is the number of nodes in the HCN(n), f ≤ n - 1 if n = 3 or 4 and f ≤ n if n ≥ 5. Our results can be applied to the hierarchical folded-hypercube network as well. © 2003 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1002/net.v43:1 | Networks |
Keywords | Field | DocType |
hamiltonian cycle,gray code,fault tolerant,hypercube | Combinatorics,Embedding,Hamiltonian (quantum mechanics),Hamiltonian path,Fault tolerant embedding,Gray code,Fault tolerance,Hypercube,Mathematics | Journal |
Volume | Issue | Citations |
43 | 1 | 6 |
PageRank | References | Authors |
0.48 | 16 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jung-Sheng Fu | 1 | 461 | 24.92 |
| Gen-Huey Chen | 2 | 979 | 89.32 |