The 4-Regular Edge-Transitive Graphs of Girth 4

2015/11/20 by Tomas Boothby, Boothby, Tomas, Matt DeVos +1
Computer Science · Engineering · Mathematics · #05C25 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1511.06794

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

Abstract

This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.

Related

• On edge-girth-regular graphs: lower bounds and new families
• On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
• Edge-girth-regular graphs arising from biaffine planes and Suzuki groups
• Recipes for Edge-Transitive Tetravalent Graphs
• Characterizing all K₄-free well-edge-dominated graphs of girth 3