A graph Γ is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Γ) acting transitively on its edge set but not on its vertex set. In the case of G = A, we call Γ a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p.
LU Zaiping, WANG Changqun & XU MingyaoLMAM, School of Mathematical Sciences, Peking University, Beijing 100871, China
