There is no (95, 40, 12, 20) strongly regular graph
Jernej Azarija, Tilen Marc
Abstract
Jernej Azarija, Tilen Marc
Abstract
Abstract We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.
OpenAlex reports 8 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 We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.
Key concepts: Mathematics, Combinatorics, Strongly regular graph, Regular graph, Graph, Distance-regular graph, Complement graph, Cubic graph