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
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
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Cycles embedding in hypercubes with node failures
Information Processing Letters
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
Computers & Mathematics with Applications
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
A note on cycle embedding in folded hypercubes with faulty elements
Information Processing Letters
Fault-free cycles in folded hypercubes with more faulty elements
Information Processing Letters
Some results on topological properties of folded hypercubes
Information Processing Letters
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Discrete Applied Mathematics
A further result on fault-free cycles in faulty folded hypercubes
Information Processing Letters
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Theoretical Computer Science
| Hi-index | 0.04 |
Let FF"v be the set of faulty nodes in an n-dimensional folded hypercube FQ"n with |FF"v|@?n-2. In this paper, we show that if n=3, then every edge of FQ"n-FF"v lies on a fault-free cycle of every even length from 4 to 2^n-2|FF"v|, and if n=2 and n is even, then every edge of FQ"n-FF"v lies on a fault-free cycle of every odd length from n+1 to 2^n-2|FF"v|-1.