An infinite class of Neumaier graphs and non-existence results

DOI10.1016/J.JCTA.2022.105684MaRDI QIDQ2084987zbMATH OpenOpenAlexWikidataFDO

Authors Aida Abiad, Wouter Castryck, Jack H. Koolen, S. Zeijlemaker, Maarten De Boeck

Publication date 14 October 2022

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphsedge-regular graphsJacobi sumsNeumaier graphsregular cliques

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Association schemes, strongly regular graphs (05E30)

Abstract: A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs, and using Jacobi sums, we show that our construction produces infinitely many instances. Moreover, we prove some necessary conditions for the existence of (strictly) Neumaier graphs that allow us to show that several parameter sets are not admissible.

Recommendations

• A note on Neumann problems on graphs
• scientific article; zbMATH DE number 6019705
• scientific article; zbMATH DE number 1555260
• scientific article; zbMATH DE number 4095512
• scientific article; zbMATH DE number 4012671
• scientific article; zbMATH DE number 866669
• Publication:3204497
• A Riemann-Roch Theorem on Infinite Graphs
• scientific article; zbMATH DE number 3185006
• scientific article; zbMATH DE number 881157

Cites work

• Another construction of edge-regular graphs with regular cliques
• Cayley-Deza graphs with fewer than 60 vertices
• Edge-regular graphs with regular cliques
• scientific article; zbMATH DE number 3941638 (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?)
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 51347 (Why is no real title available?)
• scientific article; zbMATH DE number 1131801 (Why is no real title available?)
• On cliques in edge-regular graphs
• On subgroup perfect codes in Cayley graphs
• Perfect codes in Cayley graphs
• Strongly regular graphs
• The smallest strictly Neumaier graph and its generalisations

Cited in

(8)

• Neumaier graphs with few eigenvalues
• The smallest strictly Neumaier graph and its generalisations
• A general construction of strictly Neumaier graphs and a related switching
• On the Existence of Small Strictly Neumaier Graphs
• Vertex-transitive Neumaier graphs
• Hoffman colorability of (strongly) regular graphs
• Edge-regular graphs with fixed smallest eigenvalue with an application to Neumaier graphs
• Neumaier graphs from cyclotomy with small coherent rank

This page was built for publication: An infinite class of Neumaier graphs and non-existence results

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