English

Locally $s$-distance transitive graphs

Combinatorics 2010-10-29 v2 Group Theory

Abstract

We give a unified approach to analysing, for each positive integer ss, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally ss-arc transitive graphs of diameter at least ss. A graph is in the class if it is connected and if, for each vertex vv, the subgroup of automorphisms fixing vv acts transitively on the set of vertices at distance ii from vv, for each ii from 1 to ss. We prove that this class is closed under forming normal quotients. Several graphs in the class are designated as degenerate, and a nondegenerate graph in the class is called basic if all its nontrivial normal quotients are degenerate. We prove that, for s2s\geq 2, a nondegenerate, nonbasic graph in the class is either a complete multipartite graph, or a normal cover of a basic graph. We prove further that, apart from the complete bipartite graphs, each basic graph admits a faithful quasiprimitive action on each of its (1 or 2) vertex orbits, or a biquasiprimitive action. These results invite detailed additional analysis of the basic graphs using the theory of quasiprimitive permutation groups.

Keywords

Cite

@article{arxiv.1003.2274,
  title  = {Locally $s$-distance transitive graphs},
  author = {Alice Devillers and Michael Giudici and Cai Heng Li and Cheryl E. Praeger},
  journal= {arXiv preprint arXiv:1003.2274},
  year   = {2010}
}

Comments

Revised after referee reports

R2 v1 2026-06-21T14:56:33.618Z