Topological Properties of Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Path bipancyclicity of hypercubes
Information Processing Letters
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
On path bipancyclicity of hypercubes
Information Processing Letters
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Information Processing Letters
A note on cycle embedding in hypercubes with faulty vertices
Information Processing Letters
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
| Hi-index | 0.89 |
Let Q"n denote an n-dimensional hypercube with n=2, P be a path of length h in Q"n and F@?E(Q"n)\E(P). Recently, Tsai proved that if 1=