Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

100%

Cao J., Shi M., Feng L.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 4

805-817

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Cao J.

1 Feng L.

1 Shi M.

1 2016

Wyniki wyszukiwania

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes