Finite 2-distance transitive graphs
Group Theory
2015-07-07 v1
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.
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}
}