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

Abstract: A graph $G$ on $m$ vertices is pancyclic if it contains cycles of length $l$, $3\leq l \leq 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.