arXiv2019
A graph $Γ$ is $G$-symmetric if $G$ is a group of automorphisms of $Γ$ which is transitive on the set of ordered pairs of adjacent vertices of $Γ$. If $V(Γ)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such that for blocks $B, C \in {\cal B}$ adjacent in the quotient graph $Γ_{\cal B}$ of $Γ$ relative to ${\cal B}$, exactly one vertex of $B$ has no neighbour in $C$, then $Γ$ is called an almost multicover of $Γ_{\cal B}$. In this case an incidence structure with point set ${\cal B}$ arises naturally, and it is a $(G, 2)$-point-transitive and $G$-block-transitive 2-design if in addition $Γ_{\cal B}$ is a complete graph. In this paper we classify all $G$-symmetric graphs $Γ$ such that (i) ${\cal B}$ has block size $|B| \ge 3$; (ii) $Γ_{\cal B}$ is complete and almost multi-covered by $Γ$; (iii) the incidence structure involved is a linear space; and (iv) $G$ contains a regular normal subgroup which is elementary abelian. This classification together with earlier results in [A. Gardiner and C. E. Praeger, Australas. J. Combin. 71 (2018) 403--426], [M.~Giulietti et al., J. Algebraic Combin. 38 (2013) 745--765] and [T. Fang et al., Electronic J. Combin. 23 (2) (2016) P2.27] completes the classification of symmetric graphs satisfying (i) and (ii).