Finite locally-quasiprimitive graphs. (Q2928446)

Let \(\Gamma\) be a finite graph and \(G\) be a subgroup in \(\Aut(\Gamma)\). If the stabilizer \(G_v\) acts transitively on the neighbourhood \(\Gamma(v)\) for every vertex \(v\) of \(\Gamma\) then \(\Gamma\) is called \(G\)-locally-transitive. A connected \(G\)-locally-transitive graph is bipartite or arc-transitive. A permutation group is called quasiprimitive if each of its non-trivial normal subgroups is transitive. If the induced permutation group \(G_v^{\Gamma(v)}\) of the stabilizer \(G_v\) is primitive (resp. quasiprimitive) for every vertex \(v\) of \(\Gamma\) then \(\Gamma\) is called \(G\)-locally-primitive (resp. \(G\)-locally-quasiprimitive). It is easy to see that a locally-quasiprimitive graph is neither necessarily vertex-transitive nor locally-primitive. The second author, \textit{C. E. Praeger, A. Venkatesh} and \textit{S. Zhou} [in Discrete Math. 246, No. 1-3, 197-218 (2002; Zbl 0996.05068)] studied the class of vertex-transitive locally-quasiprimitive graphs. A systematic study of locally-primitive graphs was carried out by \textit{M. Giudici}, the second author and \textit{C. E. Praeger} [in Trans. Am. Math. Soc. 356, No. 1, 291-317 (2004; Zbl 1022.05033) and J. Group Theory 9, No. 5, 641-658 (2006; Zbl 1113.05047)]. In this paper, the authors extend the study to the locally-quasiprimitive graphs.