On biprimitive semisymmetric graphs

Yunsong Gan, Weijun Liu, Binzhou Xia

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma )$ acts transitively on the edge set but not on the vertex set. For a subgroup $…