On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Embedding a ring in a hypercube with both faulty links and faulty nodes
Information Processing Letters
Parallel computation: models and methods
Parallel computation: models and methods
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
On path bipancyclicity of hypercubes
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.89 |
Let f"v denote the number of faulty vertices in an n-dimensional hypercube. This note shows that a fault-free cycle of length of at least 2^n-2f"v can be embedded in an n-dimensional hypercube with f"v=2n-3 and n=5. This result not only enhances the previously best known result, and also answers a question in [J.-S. Fu, Fault-tolerant cycle embedding in the hypercube, Parallel Computing 29 (2003) 821-832].