- Tytuł:
- On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
- Autorzy:
-
Cao, Jianxiang
Shi, Minyong
Feng, Lihua - Powiązania:
- https://bibliotekanauki.pl/articles/31340774.pdf
- Data publikacji:
- 2016-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
balanced hypercubes
hyper-Hamiltonian laceability
edge- hyper-Hamiltonian laceability - Opis:
- 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-hyper- Hamiltonian laceable.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 805-817
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł