Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes

Chao Wei, Rong-Xia Hao and Jou-Ming Chang

Applied Mathematics and Computation, 2020, vol. 381, issue C

Abstract: A bipartite graph G is two-disjoint-cycle-cover [r1, r2]-bipancyclic if for any even integer ℓ satisfying r1 ≤ ℓ ≤ r2, there exist two vertex-disjoint cycles C1 and C2 in G such that |V(C1)|=ℓ and |V(C2)|=|V(G)|−ℓ, where |V(G)| denotes the number of vertices in G. In this paper, we study the two-disjoint-cycle-cover bipancyclicity of the n-dimensional balanced hypercube BHn, which is a hypercube-variant network and is superior to hypercube due to having a smaller diameter. As a consequence, we show that BHn is two-disjoint-cycle-cover [4,22n−1]-bipancyclic for n ≥ 2.

Keywords: Bipancyclicity; Vertex-disjoint cycles; Disjoint-cycle cover; Balanced hypercubes (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032030271X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:381:y:2020:i:c:s009630032030271x

DOI: 10.1016/j.amc.2020.125305

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().