Locally $s$-distance transitive graphs

Details Locally $s$-distance transitive graphs Locally $s$-distance transitive graphs

2010-03-11

arxiv.org/abs/1003.2274v2

Mathematics

Combinatorics

Revised after referee reports

Scientific paper

We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph is in the class if it is connected and if, for each vertex $v$, the subgroup of automorphisms fixing $v$ acts transitively on the set of vertices at distance $i$ from $v$, for each $i$ from 1 to $s$. 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 $s\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.

Affiliated with

Also associated with

No associations

Rating

Locally $s$-distance transitive graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Locally $s$-distance transitive graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locally $s$-distance transitive graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540157