Topological Properties of Hypercubes
IEEE Transactions on Computers
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
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Highly fault-tolerant cycle embeddings of hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
Computers & Mathematics with Applications
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
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
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
| Hi-index | 0.00 |
An n -dimensional folded hypercube FQ n is an attractive variance of an n -dimensional hypercube Q n , which is obtained by a standard hypercube with some extra edges established between its vertices. FQ n for any odd n is known to be bipartite. In this paper, for any FQ n (n *** 2) with at most 2n *** 3 faulty edges in which each vertex is incident with at least two fault-free edges, we prove that there exists a fault-free cycle of every even length from 4 to 2 n , and when n *** 2 is even, there also exists a fault-free cycle of every odd length from n + 1 to 2 n *** 1. The result is optimal with respect to the number of edges faults tolerated.