Two-disjoint-cycle-cover pancyclicity of data center networks

Rong-Xia Hao, Xiao-Wen Qin, Hui Zhang and Jou-Ming Chang

Applied Mathematics and Computation, 2024, vol. 475, issue C

Abstract: A graph G is two-disjoint-cycle-cover [r1,r2]-pancyclic if for any integer ℓ satisfying r1≤ℓ≤r2, there exist two vertex-disjoint cycles C1 and C2 in G such that |V(C1)|=ℓ and |V(C2)|=|V(G)|−ℓ. The k-dimensional data center network DCell with n port switches and order tk,n, denoted by Dk,n, plays an important role in big data cloud computing. In this paper, we study the structural properties of Dk,n and show that Dk,n is two-disjoint-cycle-cover [3,⌊tk,n2⌋]-pancyclic for n≥7 and n+k≥11, that is, for any integer ℓ satisfying 3≤ℓ≤⌊tk,n2⌋, there exist two vertex-disjoint cycles C1 and C2 such that |V(C1)|=ℓ and |V(C2)|=tk,n−ℓ in Dk,n. This paper generalizes the results about the Hamiltonicity in (Wang et al., 2015 [25]) and the pancyclicity in (Hao and Tian, 2021 [11]).

Keywords: Pancyclicity; Vertex-disjoint cycles; Disjoint-cycle-cover; Data center networks (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001887
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:475:y:2024:i:c:s0096300324001887

DOI: 10.1016/j.amc.2024.128716

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