Metraipolis › archive › dc_e8d01692ce2d
A unified framework for existing and new constructions of Neumaier graphs — arXiv:2610.01273
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01273
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T17:41:08.171Z
- SHA-256 of the archived text
02a56032e6fc710506b857943af6afe67d1cae32c85f2d815199b37d3fe4548c- Stable URL of this page
https://metraipolis.com/documento/dc_e8d01692ce2d
How to cite
A unified framework for existing and new constructions of Neumaier graphs — arXiv:2610.01273 — arXiv (en), https://arxiv.org/abs/2610.01273 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e8d01692ce2d (Metraipolis archive dc_e8d01692ce2d, sha256 02a56032e6fc710506b857943af6afe67d1cae32c85f2d815199b37d3fe4548c)
BibTeX
@misc{dce8d01692ce2d,
title = {A unified framework for existing and new constructions of Neumaier graphs — arXiv:2610.01273},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01273},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e8d01692ce2d; sha256 02a56032e6fc710506b857943af6afe67d1cae32c85f2d815199b37d3fe4548c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01273. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A Neumaier graph is a non-complete edge-regular graph containing a regular clique; it is called strictly Neumaier if it is not strongly regular. In this paper we present a construction using finite rings that unifies several known results and yields three new families, each containing infinitely many strictly Neumaier graphs. We characterize when the resulting graphs are strongly regular. The family obtained from norm functions of finite field extensions includes the collinearity graphs of generalized quadrangles of \(*\)-Tits type arising from the classical hyperoval. We further show that, when the cyclotomic numbers involved have order at most seven, four types of rings suffice to obtain, up to isomorphism, all strictly Neumaier graphs arising from our construction. As a consequence of our results, each of these four types has now been used to construct Neumaier graphs. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.01273 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T16:06:55.846Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).