a note on automorphism groups of cubic semisymmetric graphs of special order

A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex transitive. the class of semisymmetric graphs was first introduced by folkman [2]. by using group theoretic methods, iofinova and ivanov [4] in 1985 classified cubic semisymmetric graphs whose automorphism group acts primitively on both biparts. this was the first classification theorem for such graphs. in this paper we examine the results for automorphism groups of semisymmetric connected cubic graph of order 44p, p prime