On basic 2-arc-transitive graphs
Abstract
A connected graph =(V,E) of valency at least 3 is called a basic 2-arc-transitive graph if its full automorphism group has a subgroup G with the following properties: (i) G acts transitively on the set of 2-arcs of , and (ii) every minimal normal subgroup of G has at most two orbits on V. In her papers [17,18], Praeger proved a connected 2-arc-transitive graph of valency at least 3 is a normal cover of some basic 2-arc-transitive graph, and characterized the group-theoretic structures for basic 2-arc-transitive graphs. Based on Praeger's theorems on 2-arc-transitive graphs, this paper presents a further understanding on basic 2-arc-transitive graphs.
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.