The smallest strictly Neumaier graph and its generalisations

zbMath1414.05223arXiv1809.03417MaRDI QIDQ2420557

Rhys J. Evans, Sergey Viktorovich Goryainov, Dmitry Panasenko

Publication date: 6 June 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.03417

zbMATH Keywords

regular graphregular clique

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Neumaier graphs with few eigenvalues ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ Edge-regular graphs with regular cliques ⋮ Another construction of edge-regular graphs with regular cliques ⋮ An infinite class of Neumaier graphs and non-existence results

Uses Software

• GAP
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cliques in edge-regular graphs
• Spectra of graphs
• A prolific construction of strongly regular graphs with the \(n\)-e. c. property
• Graphs with odd cocliques
• Delsarte clique graphs
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Cayley-Deza graphs with fewer than 60 vertices
• More on block intersection polynomials and new applications to graphs and block designs
• Completely regular codes
• The Magma algebra system. I: The user language
• Edge-regular graphs with regular cliques
• A census of small transitive groups and vertex-transitive graphs
• An Introduction to Incidence Geometry
• The Uniqueness of the Triangular Association Scheme
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• On a Characterization of the Triangular Association Scheme
• On the Uniqueness of the Triangular Association Scheme
• Deza graphs: A generalization of strongly regular graph
• Construction of strongly regular graphs using affine designs

This page was built for publication: The smallest strictly Neumaier graph and its generalisations