Abstract
AbstractA regular graph is semisymmetric if its automorphism group acts transitively on the edge set but not on the vertex set. In this article, we give a complete list of connected semisymmetric graphs of square‐free order and valency 5. The list consists of a single graph, the incidence graph of a generalized hexagon of order , and an infinite family arising from some groups with cyclic Fitting subgroup.
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
