On the Existence of Small Strictly Neumaier Graphs

DOI10.1007/S00373-024-02779-4MaRDI QIDQ6489361zbMATH OpenFDO

Authors Aida Abiad, Maarten De Boeck, S. Zeijlemaker

Publication date 21 April 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00373-024-02779-4

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Association schemes, strongly regular graphs (05E30) Integer programming (90C10)

Recommendations

• The smallest strictly Neumaier graph and its generalisations
• An infinite class of Neumaier graphs and non-existence results
• Neumaier graphs with few eigenvalues
• A general construction of strictly Neumaier graphs and a related switching
• Edge-regular graphs with regular cliques

Cites work

• An infinite class of Neumaier graphs and non-existence results
• Another construction of edge-regular graphs with regular cliques
• Applications of integer programming methods to cages
• Cayley-Deza graphs with fewer than 60 vertices
• Edge-regular graphs with regular cliques
• scientific article; zbMATH DE number 3875292 (Why is no real title available?)
• scientific article; zbMATH DE number 3730160 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Neumaier graphs with few eigenvalues
• Non existence of some mixed Moore graphs of diameter 2 using SAT
• On cliques in edge-regular graphs
• The CRC handbook of combinatorial designs
• The smallest strictly Neumaier graph and its generalisations

Cited in

(2)

• Vertex-transitive Neumaier graphs
• Hoffman colorability of (strongly) regular graphs

This page was built for publication: On the Existence of Small Strictly Neumaier Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489361)