Topological Properties of Hypercubes
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
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Conditional Fault-Tolerant Hamiltonicity of Twisted Cubes
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Conditional Fault-Tolerant Cycle-Embedding of Crossed Cube
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Cycles embedding in hypercubes with node failures
Information Processing Letters
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Conditional matching preclusion sets
Information Sciences: an International Journal
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Some results on topological properties of folded hypercubes
Information Processing Letters
On path bipancyclicity of hypercubes
Information Processing Letters
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
An optimal result on fault-tolerant cycle-embedding in alternating group graphs
Information Processing Letters
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Information Sciences: an International Journal
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults
Theoretical Computer Science
Regular connected bipancyclic spanning subgraphs of hypercubes
Computers & Mathematics with Applications
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Fault-tolerant cycle embedding in the faulty hypercubes
Information Sciences: an International Journal
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences: an International Journal
| Hi-index | 0.08 |
The hypercube has been one of the most popular interconnection networks for parallel computer/communication systems. In this paper, we assume that each node is incident with at least two fault-free links. Under this assumption, we show that every fault-free edge lies on a fault-free cycle of every even length from 6 to 2^n inclusive, even if it has up to 2n-5 link faults. The result is optimal with respect to the number of link faults tolerated.