|
|
|
|
cubic semisymmetric graphs of order 44p or 44p2
|
|
|
|
|
|
|
|
نویسنده
|
fallahpour samira ,salarian mohammadreza
|
|
منبع
|
international journal of group theory - 2024 - دوره : 13 - شماره : 2 - صفحه:161 -172
|
|
چکیده
|
A simple graph is called semisymmetric if it is regular and edge-transitive but not vertextransitive. let p be an arbitrary prime. folkman [j. folkman, regular line-symmetric graphs, j. combinatorial theory, 3 (1967) 215–232.] proved that there are no cubic semisymmetric graphs of order 2p or 2p2 . in this paper, an extension of his result in the case of cubic graphs of order 44p or 44p2 is given. by using group theoretic methods, we prove that there are no connected cubic semisymmetric graphs of order 44p or 44p2 .
|
|
کلیدواژه
|
semisymmetric graph ,edge-transitive graph ,vertex-transitive graph
|
|
آدرس
|
kharazmi university, faculty of mathematical and computer science, iran, kharazmi university, faculty of mathematical and computer science, iran
|
|
پست الکترونیکی
|
salarian78@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|