Abstract
A graph Γ is called G-basic if G is quasiprimitive or bi-quasiprimitive on the vertex set of Γ, where G⩽Aut(Γ). It is known that locally primitive vertex-transitive graphs are normal covers of basic ones. In this paper, a complete classification of the basic locally primitive vertex-transitive graph of order 2p2 is given, where p is an odd prime.
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.
