Cubic semisymmetric graphs of order $44p$ or $44p^{2}$
نویسندگان
1 Department of Mathematics, Graduate School of Science, Kyoto University, Kyoto, JAPAN
2 Department of Mathematics, Graduate School of Science, Kyoto University, Kyoto, JAPAN
3 Department of Mathematics, Graduate School of Science, Kyoto University, Kyoto, JAPAN
doi
10.22108/ijgt.2023.136903.1832چکیده
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}$.
