Half-transitive graphs of prime-cube order (Q686004)

A graph \(X\) is said to be 1/2-transitive if \(\Aut(X)\) acts transitively on the vertices and edges of \(X\), but not on the arcs of \(X\). The author proves that to within isomorphism there are precisely \((p-1)/2\) half- transitive graphs of degree 4 and order \(p^ 3\), \(p\) an odd prime. In particular, this means that Holt's graph on 27 vertices is the only half- transitive graph of degree 4 and order 27. Interestingly, this is in disagreement with a commont at the beginning of Holt's paper (\textit{D. F. Holt} [A graph which is edge-transitive but not arc-transitive, J. Graph Theory 5, 201-204 (1981; Zbl 0423.05020)]).