A graph is -symmetric if admits 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 is imprimitive on , namely when admits a nontrivial -invariant partition , the quotient graph of with respect to is always -symmetric and sometimes even -arc transitive. (A -symmetric graph is -arc transitive if is transitive on the set of oriented paths of length two.) In this paper we obtain necessary conditions for to be -arc transitive (regardless of whether is -arc transitive) in the case when is an odd prime , where is the block size of and is the number of vertices in a block having neighbours in a fixed adjacent block. These conditions are given in terms of and two other parameters with respect to together with a certain 2-point transitive block design induced by . We prove further that if or then these necessary conditions are essentially sufficient for to be -arc transitive.

生成讲解博客的中文版本

生成AI智能校验的中文版本