p. 183 - 186 Cubic edge-transitive graphs of order 4p^{2}M. Alaeiyan and B. N. Onagh Received: December 29, 2007;
Revised: January 13, 2009;
Accepted: May 6, 2009
Abstract.
A regular graph G is said to be semisymmetric
if its full automorphism group acts transitively
on its edge-set but not on its vertex-set. It was shown by Folkman
[5] that a regular edge-transitive graph of order 2p or 2p^{2}
is necessarily vertex-transitive, where p is a prime.
In this paper, it is proved that there is no connected
semisymmetric cubic graph of order 4p^{2}, where p is a prime.
Keywords:
semisymmetric graph, cubic graph, regular covering, solvable group.
AMS Subject classification:
Primary: 05C25, 20B25.
Version to read:
PDF
Compressed Postscript
Version to read
ISSN 0862-9544 (Printed edition) Faculty of Mathematics, Physics and Informatics Comenius University 842 48 Bratislava, Slovak Republic Telephone: + 421-2-60295111 Fax: + 421-2-65425882 e-Mail: amuc@fmph.uniba.sk Internet: www.iam.fmph.uniba.sk/amuc © 2009, ACTA MATHEMATICA UNIVERSITATIS COMENIANAE |