Abstract
AbstractA connected cubic graph having 75,600 vertices is shown to exist, with the symmetric group S10 as a group of automorphisms acting transitively on its 5‐arcs. This graph is not bipartite, nor is it a covering of any other known 4‐ or 5‐arc‐transitive graph.
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.
