A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive. In 1971, Chao characterized all weakly symmetric graphs of prime order and showed that such graphs are also transitive on directed edges. In this paper we determine all weakly symmetric graphs of order twice a prime and show that these graphs too are directed-edge transitive. © 1987.
Publication Source (Journal or Book title)
Journal of Combinatorial Theory, Series B
Cheng, Y., & Oxley, J. (1987). On weakly symmetric graphs of order twice a prime. Journal of Combinatorial Theory, Series B, 42 (2), 196-211. https://doi.org/10.1016/0095-8956(87)90040-2