A new approach to pancyclicity of Paley graphs I

2023/08/09 by Yusaku Nishimura, Nishimura, Yusaku
Computer Science · Mathematics · Physics and Astronomy · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2308.04759

openalex publication_date 2023/08/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be an undirected graph of order n and let C_i be an i-cycle graph. G is called pancyclic if G contains a C_i for any i∈ \3,4,…,n\. We show that the pancyclicity of specific Cayley graphs and the Cartesian product of specific two graphs. As a corollary of these two theorems, we provide a new proof of the pancyclicity of the Paley graph.

Related

• Pancyclicity in the Cartesian Product (K₉-C₉ )ⁿ
• Pancyclicity of highly connected graphs
• A sufficient condition for pancyclic graphs
• Some Sufficient Conditions on Pancyclic Graphs
• Chvátal-Erdős condition for pancyclicity