A formulation of a (q+1,8)-cage

2015/01/11 by M. Abreu, Abreu, M., Gabriela Araujo‐Pardo +5
Computer Science · Engineering · Mathematics · #05B25 #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.02448

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

Abstract

Let q≥ 2 be a prime power. In this note we present a formulation for obtaining the known (q+1,8)-cages which has allowed us to construct small (k,g)--graphs for k=q-1, q and g=7,8. Furthermore, we also obtain smaller (q,8)-graphs for even prime power q.

Related

• An explicit formula for obtaining (q+1,8)-cages and others small regular graphs of girth 8
• Families of small regular graphs of girth 7
• A construction of small (q-1)-regular graphs of girth 8
• On the existence of (r,g,χ)-cages
• Computational determination of (3,11) and (4,7) cages