On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao; Minyong Shi; Lihua Feng

Discussiones Mathematicae Graph Theory (2016)

  • Volume: 36, Issue: 4, page 805-817
  • ISSN: 2083-5892

Abstract

top
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.

How to cite

top

Jianxiang Cao, Minyong Shi, and Lihua Feng. "On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes." Discussiones Mathematicae Graph Theory 36.4 (2016): 805-817. <http://eudml.org/doc/287097>.

@article{JianxiangCao2016,
abstract = {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.},
author = {Jianxiang Cao, Minyong Shi, Lihua Feng},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {balanced hypercubes; hyper-Hamiltonian laceability; edge- hyper-Hamiltonian laceability; edge-hyper-Hamiltonian laceability},
language = {eng},
number = {4},
pages = {805-817},
title = {On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes},
url = {http://eudml.org/doc/287097},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Jianxiang Cao
AU - Minyong Shi
AU - Lihua Feng
TI - On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 4
SP - 805
EP - 817
AB - 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.
LA - eng
KW - balanced hypercubes; hyper-Hamiltonian laceability; edge- hyper-Hamiltonian laceability; edge-hyper-Hamiltonian laceability
UR - http://eudml.org/doc/287097
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.