Topological Properties of Hypercubes
IEEE Transactions on Computers
Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Long cycles in hypercubes with optimal number of faulty vertices
Journal of Combinatorial Optimization
| Hi-index | 0.07 |
Let F be a set of faulty edges in hypercube Q"n with |F|==5. We prove that there still exists a fault-free Hamiltonian cycle in Q"n if the following two conditions are satisfied: (1) the degree of every vertex is at least two, and (2) there do not exist a pair of nonadjacent vertices in a 4-cycle whose degrees are both two after faulty edges are removed.