The Classification of Connected Imprimitive Arc-transitive Graphs on Zp×Zp

<正>The term (di)graph is employed to mean that a graph in question is either a directed graph or an undirected graph.The symbol G(p,r)represents the digraph defined by Chao: V(G(p,r))=Zp,E(G(p,r))={(x,y)|x-y∈Hr},where P is a prime,r is a positive divisor of P-1 and Hr is the unique subgroup of order r in Aut(Zp).A Cayley graph (?)=Cay(G,S)is called imprimitive if A=Aut((?))acts imprimitively on V((?)).Let (?)=Cay(G,S)be a connected imprimitive arc-transitive graph on G=Z×Z,B={B0,B1,…,Bp-1}the complete block system of A=Aut((?))on V((?))=G and K the kernel of A on B.Then obviously K≠1.