Processor allocation in an N-cube multiprocessor using gray codes
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
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
Some results on topological properties of folded hypercubes
Information Processing Letters
On the enhanced hyper-hamiltonian laceability of hypercubes
CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
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
Cycles passing through a prescribed path in a hypercube with faulty edges
Information Processing Letters
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
Information Sciences: an International Journal
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
Hamiltonian cycles in hypercubes with 2n-4 faulty edges
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Theoretical Computer Science
| Hi-index | 0.89 |
In this paper, we consider the problem of a fault-free Hamiltonian cycle passing through prescribed edges in an n-dimensional hypercube Q"n with some faulty edges. We obtain the following result: Let n=2, F@?E(Q"n), E"0@?E(Q"n)\F with 1=