On the Existence of Small Strictly Neumaier Graphs
Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker
Source record
Source: Crossref
Published: Apr 8, 2024
DOI: 10.1007/s00373-024-02779-4
Open original source ↗Source abstract
Abstract A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the smallest strictly Neumaier graph with parameters (16, 9, 4; 2, 4), we establish the existence of a strictly Neumaier graph with parameters (25, 12, 5; 2, 5), and we disprove the existence of strictly Neumaier graphs with parameters (25, 16, 9; 3, 5), (28, 18, 11; 4, 7), (33, 24, 17; 6, 9), (35, 2212; 3, 5), (40, 30, 22; 7, 10) and (55, 34, 18; 3, 5). Our proofs use combinatorial techniques and a novel application of integer programming methods.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.