Pancyclicity in the Cartesian Product (K₉-C₉ )^n

arXiv2206.07381MaRDI QIDQ6402152FDOQ6402152

Rajesh Mahadevan, Syeda Afiya

Publication date: 15 June 2022

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

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

This page was built for publication: Pancyclicity in the Cartesian Product $(K_9-C_9 )^n$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402152)