作者: Tsung-Han Tsai , Jimmy J. M. Tan , Tzu-Liang Kung , Lih-Hsing Hsu
DOI:
关键词:
摘要: A bipartite graph is hamiltonian laceable if there exists a path between any two vertices that are in different partite sets. G said to be hyper-hamiltonian if, for vertex v of G, - {v} joining located the same set from v. In this paper, we further improve laceability hypercubes by showing that, x, y one Qn, n ≥ 4, and w other set, H Qn {w} x such dH(x, z) = l z e V (Qn) {x,y,w} every integer satisfying both dQn(x, ≤ 2n 2 dQn(z; y) 2|(l dQn(x; z)). As consequence, many attractive properties follow directly our result.