8 research outputs found
On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 βͺ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v β Vi, i β {0, 1}, any edge e β E(G β v), there is a Hamiltonian path containing e in G β v between any two vertices of V1βi. In this paper, we prove that BHn is edge-hy per- Hamiltonian laceable