Cubic vertex-transitive graphs of girth seven
Abstract
In this paper we classify cubic vertex-transitive graphs of girth 7, based on their signature. Such a graph is either a truncation of an arc-transitive dihedral scheme on a 7-regular graph, the skeleton of a rotary map of type \7,3\, a member of an infinite family of Cayley graphs, or is one of the of the generalised Petersen graphs Pet(13,5), Pet(15,4), Pet(17,4) or the Coxeter graph. We show that for a cubic vertex-transitive graphs of girth 7, if every edge of is contained in the same number of 7-cycles, then is also arc-transitive.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.