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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
