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
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
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Fault-free cycles in folded hypercubes with more faulty elements
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Cycles embedding on folded hypercubes with faulty nodes
Discrete Applied Mathematics
| Hi-index | 0.89 |
Folded hypercube is a well-known variation of the hypercube structure and can be constructed from a hypercube by adding a link to every pair of nodes with complementary addresses. Let FF"v (respectively, FF"e) be the set of faulty nodes (respectively, faulty links) in an n-dimensional folded hypercube FQ"n. Fu has showed that FQ"n-FF"v-FF"e for n=3 contains a fault-free cycle of length at least 2^n-2|FF"v| if |FF"v|+|FF"e|==n that were not covered by Fu's result. We obtain the same lower bound of the longest fault-free cycle length, 2^n-2|FF"v|, under the constraints that (1) |FF"v|+|FF"e|=