Cubic edge-transitive graphs of order 4p2.docVIP

ActaMath.Univ.Comenianae Vol.LXXVIII, 2(2009),pp.183–186 183 CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 4p 2 M. ALAEIYAN and B. N. ONAGH Abstract. AregulargraphΓissaidtobesemisymmetricifitsfullautomorphism 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 2p2 is necessarily vertex-transitive, where p is a prime. In this paper, it is proved that there is no connectedsemisymmetriccubicgraphoforder4p2,wherepisaprime. 1. Introduction Throughout this paper, graphs are assumed to be ?nite, simple, undirected and connected. ForagraphΓ,wedenotebyV(Γ),E(Γ), A(Γ)andAut(Γ)itsvertex set,edgeset,arcsetandfullautomorphismgroup,respectively. Foru,v∈V(Γ), denotebyuvtheedgeincidenttouandvinΓ,andbyN (u)theneighborhoodof Γ u inΓ, that is, the set of verticesadjacent touinΓ. If asubgroup GofAut(Γ) acts transitively on V(Γ), E(Γ) and A(Γ), we say that Γ is G-vertex-transitive, G-edge-transitive and G-arc-transitive, respectively. In the special case, when G=Aut(Γ)wesaythatΓisvertex-transitive,edge-transitiveandarc-transitive(or symmetric),respectively. AregularG-edge-transitivebutnotG-vertex-transitive graph,willbereferredtoasaG-semisymmetricgraph. Inparticular,ifG=Aut(Γ), thenthegraphΓissaidtobesemisymmetric. Let N be a subgroup of Aut(Γ). The quotient graph Γ/N or ΓN of Γ relative toN isde?nedasthegraphsuchthatthesetΣofN-orbitsinV(Γ)isthevertex setofΓ/N andB,C ∈Σareadjacentifandonlyifthereexistu∈B andv∈C suchthatuv∈E(Γ). A graph Γe is called a covering of a graph Γ with projection ?:Γe→Γ, if ? is asurjectionfromV(Γe)toV(Γ)suchthat?| :N (?v)→N (v)isabijection N (?v) e Γ Γe Γ foranyverticesv∈V(Γ)andv?∈??1(v). The?breofanedgeoravertexisits preimageunder?. IfΓeisconnected,thenanytwovertexoredge?bresareofthe samecardinalityn. Thisnumberiscalledthefoldnumberofthecoveringandwe saythat?isann-foldcovering. AcoveringΓeofΓwithaprojection?issaidtobe regular(orK-cove