| نویسندگان | Babai A., Khosravi B. |
| نشریه | Ars Combinatoria |
| تاریخ انتشار | ۲۰۱۷ |
چکیده مقاله
A regular graph T is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. Some authors classified semisymmetric cubic graphs of orders 10p and 10p2. Also it is proved that there is no connected semisymmetric cubic graph of order 10p3. In this paper, we continue this work and prove that there is no connected semisymmetric cubic graph of order 10pn, where n ≥ 4, p ≥ 7 and p ≠ 11.
لینک ثابت مقاله