The 4-Regular Edge-Transitive Graphs of Girth 4
Tomas Boothby, Matt DeVos

TL;DR
This paper characterizes all 4-regular, edge-transitive graphs with girth four, identifying four infinite families and four exceptional graphs, thus providing a complete classification of this specific graph class.
Contribution
It provides a complete classification of 4-regular, edge-transitive graphs with girth four, including infinite families and exceptional cases, filling a gap in graph theory.
Findings
Identified four infinite families of graphs.
Discovered four exceptional graphs.
Provided a complete classification of the class.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
