Finite 2-distance transitive graphs
arXiv:1507.01027
Abstract
A non-complete graph is said to be -distance transitive if is a subgroup of the automorphism group of that is transitive on the vertex set of , and for any vertex of , the stabilizer is transitive on the sets of vertices at distance 1 and 2 from . This paper investigates the family of -distance transitive graphs that are not -arc transitive. Our main result is the classification of such graphs of valency not greater than 5.