An infinite class of Neumaier graphs and non-existence results
From MaRDI portal
Publication:2084987
DOI10.1016/j.jcta.2022.105684zbMath1498.05293arXiv2109.14281OpenAlexW3203336280WikidataQ114162613 ScholiaQ114162613MaRDI QIDQ2084987
S. Zeijlemaker, Wouter Castryck, Jack H. Koolen, Aida Abiad, 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
Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)
Related Items
Cites Work
- On cliques in edge-regular graphs
- Cayley-Deza graphs with fewer than 60 vertices
- Edge-regular graphs with regular cliques
- On subgroup perfect codes in Cayley graphs
- Another construction of edge-regular graphs with regular cliques
- The smallest strictly Neumaier graph and its generalisations
- Perfect Codes in Cayley Graphs
- Strongly Regular Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item