Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 15 Jun 2022 in math.CO and cs.DM

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.