Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
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
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
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
On path bipancyclicity of hypercubes
Information Processing Letters
A note on path bipancyclicity of hypercubes
Information Processing Letters
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
Mutually independent Hamiltonian cycles in dual-cubes
The Journal of Supercomputing
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Theoretical Computer Science
Panconnectivity of Cartesian product graphs
The Journal of Supercomputing
| Hi-index | 0.89 |
A bipartite graph is vertex-bipancyclic (respectively, edge-bipancyclic) if every vertex (respectively, edge) lies in a cycle of every even length from 4 to |V(G)| inclusive. It is easy to see that every connected edge-bipancyclic graph is vertex-bipancyclic. An n-dimensional hypercube, or n-cube denoted by Q"n, is well known as bipartite and one of the most efficient networks for parallel computation. In this paper, we study a stronger bipancyclicity of hypercubes. We prove that every n-dimensional hypercube is (2n-4)-path-bipancyclic for n=3. That is, for any path P of length k with 1==3.