Abstract
A graph Γ is said to be G -semisymmetric if it is regular and there exists a subgroup G of A := Aut( Γ ) acting transitively on its edge set but not on its vertex set. In the case of G = A , we call Γ a semisymmetric graph. The aim of this paper is to investigate ( G -)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6 p 2 for an odd prime p .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
