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.
@article{bwmeta1.element.doi-10_7151_dmgt_1908,
author = {Jianxiang Cao and Minyong Shi and Lihua Feng},
title = {On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {805-817},
zbl = {1350.05071},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1908}
}
Jianxiang Cao; Minyong Shi; Lihua Feng. On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 805-817. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1908/