Affine primitive groups and semisymmetric graphs (Q1953528)

Summary: In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization,of the complete bipartite graph \(K_{p^{sp^t},p^{sp^t}}\) into connected semisymmetric graphs, where \(p\) is an prime, \(1\leq t\leq s\) with \(s\geq2\) while \(p=2\).