Semisymmetric graphs (Q932665)

In a recent paper in [Discrete Math. 307, No. 17--18, 2156--2175 (2007; Zbl 1136.05026)], \textit{A. Malnič, D. Marušič, S. Miklavič} and \textit{P. Potočnik} gave constructions for all pairwise non-isomorphic minimal semisymmetric elementary abelian covers of the Möbius-Kantor graph -- a 16-vertex 3-valent arc-transitive graph, known also as the generalized Petersen graph GP\((8,3)\). The automorphism group of this graph has a rich subgroup structure, making the problem of finding covers considerably more complex than, say, covers of the Petersen graph or the Heawood graph. It was remarked at the end of that paper that the minimal covering graphs arising from the given constructions need not always be semisymmetric. In this paper, it is shown that they are never arc-transitive, and so are always semisymmetric.