Main Article Content


A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set but not on its vertex set. In this paper, we prove thatthere is only one semisymmetric cubic graph of order 28p<sub>2</sub>, where p is a prime.



Semisymmetric covering graphs semiregular subgroup.

Article Details

How to Cite
Alaeiyan, M., & Lashani, M. (2012). A CLASSIFICATION OF SEMISYMMETRIC CUBIC GRAPHS OF ORDER 28p&sup2. Journal of the Indonesian Mathematical Society, 16(2), 139–143.