Classifying Cubic Semisymmetric Graphs of Order 18 p n

A graph X is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut (X) acting transitively on its edge set but not on its vertex set. In the case of G = A, we call X a semisymmetric graph. Let p be a prime. It was shown by Folkman (J Comb Theory 3:215–232, 1967) that a regular edge-transitive graph of order 2p or 2p ² is necessarily vertex-transitive. The smallest semisymmetric graph is the Folkman graph. In this study, we classify all connected cubic semisymmetric graphs of order 18p ⁿ , where p is a prime and \({n \geq 1}\) .