On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

• Autorzy: Jianxiang Cao , Minyong Shi , Lihua Feng
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

balanced hypercubes; hyper-Hamiltonian laceability; edge- hyper-Hamiltonian laceability

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 4
• Strony: 805-817

Daty

wydano

2016-11-01

otrzymano

2015-06-24

poprawiono

2015-12-05

zaakceptowano

2015-12-05

online

2016-10-21

Twórcy

autor

Jianxiang Cao

• School of Computer Science, Communication University of China, Beijing,

autor

Minyong Shi

• School of Computer Science, Communication University of China, Beijing,

autor

Lihua Feng

• School of Mathematics and Statistics, Central South University, Changsha,

Identyfikatory

DOI

10.7151/dmgt.1908