Symmetric graphs with 2-arc transitive quotients

TL;DR

This paper investigates conditions under which quotient graphs derived from symmetric graphs with certain group actions are 2-arc transitive, focusing on cases where the difference between block size and neighbor count is an odd prime.

Contribution

It provides necessary conditions for quotient graphs to be 2-arc transitive when the difference is an odd prime, and shows these are nearly sufficient for primes 3 and 5.

Findings

Necessary conditions involve parameters v, k, and a 2-point transitive design.

For primes 3 and 5, conditions are nearly sufficient for 2-arc transitivity.

Results connect graph symmetry with block design properties.

Abstract

A graph $\Ga$ is $G$-symmetric if $\Ga$ admits $G$ as a group of automorphisms acting transitively on the set of vertices and the set of arcs of $\Ga$, where an arc is an ordered pair of adjacent vertices. In the case when $G$ is imprimitive on $V(\Ga)$, namely when $V(\Ga)$ admits a nontrivial $G$-invariant partition $\BB$, the quotient graph $\Ga_{\BB}$ of $\Ga$ with respect to $\BB$ is always $G$-symmetric and sometimes even $(G, 2)$-arc transitive. (A $G$-symmetric graph is $(G, 2)$-arc transitive if $G$ is transitive on the set of oriented paths of length two.) In this paper we obtain necessary conditions for $\Ga_{\BB}$ to be $(G, 2)$-arc transitive (regardless of whether $\Ga$ is $(G, 2)$-arc transitive) in the case when $v-k$ is an odd prime $p$, where $v$ is the block size of $\BB$ and $k$ is the number of vertices in a block having neighbours in a fixed adjacent block. These conditions are given in terms of $v, k$ and two other parameters with respect to $(\Ga, \BB)$ together with a certain 2-point transitive block design induced by $(\Ga, \BB)$. We prove further that if $p=3$ or $5$ then these necessary conditions are essentially sufficient for $\Ga_{\BB}$ to be $(G, 2)$-arc transitive.