Finite 2-distance transitive graphs
Abstract
A non-complete graph is said to be (G,2)-distance transitive if G is a subgroup of the automorphism group of that is transitive on the vertex set of , and for any vertex u of , the stabilizer Gu is transitive on the sets of vertices at distance 1 and 2 from u. This paper investigates the family of (G,2)-distance transitive graphs that are not (G,2)-arc transitive. Our main result is the classification of such graphs of valency not greater than 5.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.