RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Embedding a ring in a hypercube with both faulty links and faulty nodes
Information Processing Letters
Distributed Ring Embedding in Faulty De Bruijn Networks
IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Embedding Hamiltonian cycles into folded hypercubes with faulty links
Journal of Parallel and Distributed Computing
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Embed Longest Rings onto Star Graphs with Vertex Faults
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
On Self-Similarity and Hamiltonicity of Dual-Cubes
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
On embedding cycles into faulty dual-cubes
Information Processing Letters
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks
Computers and Electrical Engineering
Mutually independent Hamiltonian cycles in dual-cubes
The Journal of Supercomputing
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
| Hi-index | 0.00 |
A low-degree dual-cube was proposed as an alternative to thehypercubes. A dual-cube DC(m) has m + 1 links per node, where m isthe degree of a cluster (m-cube) and one more link is used forconnecting to a node in another cluster. There are 2m+1clusters and hence the total number of nodes in a DC(m) is22m+1. In this paper, by using Gray code, we show thatthere exists a fault-free cycle containing at least22m+1-2f nodes in DC(m), m≥3, with f≤m faultynodes.