Finite 2-distance transitive graphs
classification
🧮 math.GR
keywords
transitivedistancegammagraphsvertexautomorphismclassificationfamily
read the original abstract
A non-complete graph $\Gamma$ is said to be $(G,2)$-distance transitive if $G$ is a subgroup of the automorphism group of $\Gamma$ that is transitive on the vertex set of $\Gamma$, and for any vertex $u$ of $\Gamma$, the stabilizer $G_u$ 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.