University of Isfahan International Journal of Group Theory 2251-7650 13 2 2024 06 01 Cubic semisymmetric graphs of order $44p$ or $44p^{2}$ 161 172 27739 10.22108/ijgt.2023.136903.1832 EN Samira Fallahpour Faculty of Mathematical and Computer Science, kharazmi university, Tehran, Iran Mohammadreza Salarian Faculty of Mathematical and Computer Science, kharazmi university, Tehran, Iran Journal Article 2023 02 20 A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let $p$ be an arbitrary prime. Folkman [J. Folkman, Regular line-symmetric graphs, J. Combinatorial Theory, \textbf{3} (1967) 215--232.] proved that there are no cubic semisymmetric graphs of order $2p$ or $2p^{2}$. In this paper, an extension of his result in the case of cubic graphs of order $44p$ or $44p^{2}$ is given. By using group theoretic methods, we prove that there are no connected cubic semisymmetric graphs of order $44p$ or $44p^{2}$. https://ijgt.ui.ac.ir/article_27739_cba1b8bb112d36fdd4f45c5b08c33c61.pdf