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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.