A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. In this paper we classify all connected cubic semisymmetric graphs of order 20p, p prime.
Edge-transitive graph, vertex-transitive graph, semisymmetric graph, order of a graph, classification of cubic semisymmetric graphs
SHAHSAVARAN, MOHSEN and DARAFSHEH, MOHAMMAD REZA
"Classifying semisymmetric cubic graphs of order 20p,"
Turkish Journal of Mathematics: Vol. 43:
6, Article 8.
Available at: https://journals.tubitak.gov.tr/math/vol43/iss6/8