English

Finite 2-distance transitive graphs

Group Theory 2015-07-07 v1

Abstract

A non-complete graph Γ\Gamma is said to be (G,2)(G,2)-distance transitive if GG is a subgroup of the automorphism group of Γ\Gamma that is transitive on the vertex set of Γ\Gamma, and for any vertex uu of Γ\Gamma, 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.

Keywords

Cite

@article{arxiv.1507.01027,
  title  = {Finite 2-distance transitive graphs},
  author = {Brian P. Corr and Wei Jin and Csaba Schneider},
  journal= {arXiv preprint arXiv:1507.01027},
  year   = {2015}
}
R2 v1 2026-06-22T10:05:29.329Z