Two-disjoint-cycle-cover pancyclicity of split-star networks

Hao Li, Liting Chen and Mei Lu

Applied Mathematics and Computation, 2025, vol. 487, issue C

Abstract: Pancyclicity is a stronger property than Hamiltonicity. In 1973, Bondy stated his celebrated meta-conjecture. Since then, problems related to pancyclicity have attracted a lot of attentions and interests of researchers. A connected graph G is two-disjoint-cycle-cover [t1,t2]-pancyclic or briefly 2-DCC [t1,t2]-pancyclic if for any positive integer t with t∈[t1,t2], there are two vertex-disjoint cycles C1 and C2 in G satisfying |V(C1)|=t and |V(C2)|=|V(G)|−t. In this paper, it is proved that the n-dimensional split-star network Sn2 is 2-DCC [3,⌊n!2⌋]-pancyclic when n≥3.

Keywords: Pancyclicity; Vertex-disjoint cycles; Cycle cover; Split-star networks (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324005460
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:487:y:2025:i:c:s0096300324005460

DOI: 10.1016/j.amc.2024.129085

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 ().