A general construction of strictly Neumaier graphs and a related switching

DOI10.1016/j.disc.2023.113384zbMath1514.05095arXiv2109.13884OpenAlexW3202996343MaRDI QIDQ6046159

Elena V. Konstantinova, Rhys J. Evans, Sergey Viktorovich Goryainov, Alexander Mednykh

Publication date: 15 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

perfect codeedge-regular graphregular cliqueNeumaier graphWQH-switching

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• On cliques in edge-regular graphs
• Spectra of graphs
• Delsarte clique graphs
• Cayley-Deza graphs with fewer than 60 vertices
• Perfect codes over graphs
• Completely regular codes
• Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
• Edge-regular graphs with regular cliques
• An infinite class of Neumaier graphs and non-existence results
• Neumaier graphs with few eigenvalues
• New strongly regular graphs from finite geometries via switching
• Another construction of edge-regular graphs with regular cliques
• The smallest strictly Neumaier graph and its generalisations
• Perfect codes in graphs
• Deza graphs: A generalization of strongly regular graph

This page was built for publication: A general construction of strictly Neumaier graphs and a related switching