Marston Conder
Abstract
Abstract A 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.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract A 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.
Key concepts: Combinatorics, Mathematics, Edge-transitive graph, Cubic graph, Symmetric graph, Foster graph, Voltage graph, Vertex-transitive graph