2022/06/15 by Afiya, Syeda, Rajesh, M
#05C38 #05C45 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2
paper · doi:10.48550/arxiv.2206.07381
A graph G on m vertices is pancyclic if it contains cycles of length l, 3≤ l ≤ m as subgraphs in G. The complete graph K9 on 9 vertices with a cycle C9 of length 9 deleted from K9 is denoted by (K9-C9). In this paper, we prove that (K9-C9)n, the Cartesian product of (K9-C9) taken n times, is pancyclic.