On weakly symmetric graphs of order twice a prime (Q1069953)

A graph is weakly symmetric if its automorphism group is transitive on both its vertex-set and its edge-set. \textit{C.-Y. Chao} [Trans. Am. Math. Soc. 158, 247-256 (1971; Zbl 0217.024)] characterized all weakly symmetric graphs of prime order and showed that such graphs are also transitive on directed edges. This paper determines all weakly symmetric graphs of order twice a prime and shows that these graphs too are directed-edge-transitive. The proof of this result relies on several important group-theoretic results including the recently-completed classification of finite simple groups.