Two disjoint cycles of various lengths in alternating group graph

Dongqin Cheng

Applied Mathematics and Computation, 2022, vol. 433, issue C

Abstract: Alternating group graph has been widely studied recent years because it possesses many good properties. For a graph G, the two-disjoint-cycle-cover [r1,r2]-pancyclicity refers that it contains cycles C1 and C2, where V(C1)∩V(C2)=∅,ℓ(C1)+ℓ(C2)=|V(G)| and r1≤ℓ(C1)≤r2. In this paper, it is proved that the n-dimensional alternating group graph AGn is two-disjoint-cycle-cover [3,n!4]-pancyclic, where n≥4.

Keywords: Interconnection network; Alternating group graphs; Vertex disjoint cycles; Cycle cover (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322004817
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:433:y:2022:i:c:s0096300322004817

DOI: 10.1016/j.amc.2022.127407

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