The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computation: models and methods
Parallel computation: models and methods
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
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
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.00 |
We analyze some edge-fault-tolerant properties of the folded hypercube, which is a variant of the hypercube obtained by adding an edge to every pair of nodes with complementary address. We show that an n-dimensional folded hypercube is (n - 2)-edge-fault-tolerant Hamiltonian-connected when n(≥2) is even, (n - 1)-edge-fault-tolerant strongly Hamiltonian-laceable when n(≥ 1) is odd, and (n - 2)-edgefault-tolerant hyper Hamiltonian-laceable when n(≥ 3) is odd.