Symmetric graphs with 2-arc transitive quotients
Abstract
A graph is G-symmetric if admits G as a group of automorphisms acting transitively on the set of vertices and the set of arcs of , where an arc is an ordered pair of adjacent vertices. In the case when G is imprimitive on V(), namely when V() admits a nontrivial G-invariant partition , the quotient graph of with respect to 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 to be (G, 2)-arc transitive (regardless of whether is (G, 2)-arc transitive) in the case when v-k is an odd prime p, where v is the block size of 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 (, ) together with a certain 2-point transitive block design induced by (, ). We prove further that if p=3 or 5 then these necessary conditions are essentially sufficient for to be (G, 2)-arc transitive.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.