Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.