Main Article Content
Abstract
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not vertex-transitive. In this paper, we classify all connected cubic semisymmetric graph of order 34<em>p²</em>, where p be a prime.
Keywords
Symmetric graph
semisymmetric graph
regular coverings
Article Details
How to Cite
Alaeiyan, M., & Aramian, R. (2012). A CLASSIFICATION OF THE CUBIC SEMISYMMETRIC GRAPHS OF ORDER 34<em>p²</em>. Journal of the Indonesian Mathematical Society, 17(1), 11–15. https://doi.org/10.22342/jims.17.1.9.11-15
