A construction of small (q-1)-regular graphs of girth 8

2015/01/11 by M. Abreu, Abreu, M., Gabriela Araujo‐Pardo +5
Computer Science · Engineering · Mathematics · #05C35 #05C69 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1501.02452

openalex publication_date 2015/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we construct a new infinite family of (q-1)-regular graphs of girth 8 and order 2q(q-1)² for all prime powers q≥ 16, which are the smallest known so far whenever q-1 is not a prime power or a prime power plus one itself.

Related

• Geometric constructions of small regular graphs with girth 7
• Families of small regular graphs of girth 7
• An explicit formula for obtaining (q+1,8)-cages and others small regular graphs of girth 8
• New families of small regular graphs of girth 5
• A formulation of a (q+1,8)-cage