Abstract

Many famous graphs are edge-primitive. Weiss (1973) and Guo et al. (2013) determined edge-primitive graphs of valency 3 and 5, respectively. In this paper, we study edge-primitive graphs of any prime valency. It is proved that all such graphs are 2-arc-transitive and the full automorphism groups are almost simple with the only exception the graphs being the complete bipartite graphs, and a complete classification is given of such graphs with soluble edge stabilizers, which widely extends the classifications of Weiss and Guo et al. (notice that the edge stabilizers of edge-primitive graphs with valency at most 5 are soluble).

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.