On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
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 l...
Main Authors: | Cao Jianxiang, Shi Minyong, Feng Lihua |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2016-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1908 |
Similar Items
-
Cayley Graphs Defined by Systems of Equations
by: Fuyuan Yang, et al.
Published: (2022-02-01) -
The number of zeros of Abelian integrals for a perturbation of a hyper-elliptic Hamiltonian system with a nilpotent center and a cuspidal loop
by: Ali Atabaigi
Published: (2017-10-01) -
Improved Sufficient Conditions for Hamiltonian Properties
by: Bode Jens-P., et al.
Published: (2015-05-01) -
On Vertices Enforcing a Hamiltonian Cycle
by: Fabrici Igor, et al.
Published: (2013-03-01) -
Robustness analysis of random hyper-networks based on the internal structure of hyper-edges
by: Bin Zhou, et al.
Published: (2023-01-01)