A CLASSIFICATION OF THE CUBIC SEMISYMMETRIC GRAPHS OF ORDER 34

Mehdi Alaeiyan, Rasul Aramian

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&sup2;</em>, where p be a prime.

DOI : http://dx.doi.org/10.22342/jims.17.1.9.11-15


Keywords


Symmetric graph, semisymmetric graph, regular coverings

Full Text:

PDF


DOI: https://doi.org/10.22342/jims.17.1.9.11-15

Refbacks

  • There are currently no refbacks.



Journal of the Indonesian Mathematical Society
Mathematics Department, Universitas Gadjah Mada
Senolowo, Sinduadi, Mlati, Sleman Regency, Special Region of Yogyakarta 55281, Telp. (0274) 552243
Email: jims.indoms@gmail.com


p-ISSN: 2086-8952 | e-ISSN: 2460-0245


Journal of the Indonesian Mathematical Society is licensed under a Creative Commons Attribution 4.0 International License

web statistics
View My Stats