Pancyclicity in the Cartesian Product (K_9-C_9 )^n

06/15/2022

∙

by   Syeda Afiya, et al.

∙

0

∙

share

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 K_9 on 9 vertices with a cycle C_9 of length 9 deleted from K_9 is denoted by (K_9-C_9). In this paper, we prove that (K_9-C_9)^n, the Cartesian product of (K_9-C_9) taken n times, is pancyclic.