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
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
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Cycles embedding in exchanged hypercubes
Information Processing Letters
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks
Computers and Electrical Engineering
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is odd
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Mutually independent Hamiltonian cycles in dual-cubes
The Journal of Supercomputing
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
Computers and Electrical Engineering
One-to-one disjoint path covers on k-ary n-cubes
Theoretical Computer Science
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
Information and Computation
Fault-tolerant cycle embedding in the faulty hypercubes
Information Sciences: an International Journal
Cycles embedding on folded hypercubes with faulty nodes
Discrete Applied Mathematics
| Hi-index | 0.89 |
The hypercube has been widely used as the interconnection network in parallel computers. The n-dimensional hypercube Q"n is a graph having 2^n vertices each labeled with a distinct n-bit binary strings. Two vertices are linked by an edge if and only if their addresses differ exactly in the one bit position. Let f"v denote the number of faulty vertices in Q"n. For n=3, in this paper, we prove that every fault-free edge and fault-free vertex of Q"n lies on a fault-free cycle of every even length from 4 to 2^n-2f"v inclusive even if f"v=