Semisymmetric Cubic Graphs of Order \(10p^2\)

A. BABAI1, B. KHOSRAVI2
1Dept. oF PURE MATH., FACULTY OF MATH. AND COMPUTER SCI., AMIRKABIR UNI- VERSITY OF TECHNOLOGY (TEHRAN POLYTECHNIC), 424, HAFEZ AVE., TEHRAN 15914, IRAN
2ScHOOL OF MATHEMATICS, INSTITUTE FOR RESEARCH IN FUNDAMENTAL SCIENCES (IPM), P.O.Box: 19395-5746, TEHRAN,IRAN

Abstract

A regular graph \(\Gamma\) is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. Some authors classified semisymmetric cubic graphs of orders \(10p\) and \(10p^2\). Also, it is proved that there is no connected semisymmetric cubic graph of order \(10p^3\). In this paper, we continue this work and prove that there is no connected semisymmetric cubic graph of order \(10p^n\), where \(n \geq 4\), \(p \geq 7\), and \(p \neq 11\).