Abstract
Let k and p be odd primes with k < p. All vertex-primitive graphs of order kp are classified, and those which are symmetric, or are edge-transitive but not symmetric. or are not Cayley graphs are identified. In addition, a classification is given of all vertex-primitive, edge-transitive lantisymmetric) directed graphs or order kp. The classification of the vertex-primitive symmetric graphs of order kp is used by the authors and others to complete the classification of symmetric graphs or order kp. The classification of the vertex-primitive non-Cayley graphs of order kp is used by B.D. McKay and the first author in an investigation of vertex-transitive non-Cayley graphs.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
