Metraipolis › archive › dc_87e34b1d1990
Infinite series of Deza graphs with strongly regular children — arXiv:2608.13089
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13089
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:50:13.521Z
- SHA-256 of the archived text
d84b5bcfe995d199e01e6bf577f42b1d2aa6cea9cfddd9ebfa79e617e9fe4c91- Stable URL of this page
https://metraipolis.com/documento/dc_87e34b1d1990
How to cite
Infinite series of Deza graphs with strongly regular children — arXiv:2608.13089 — arXiv (en), https://arxiv.org/abs/2608.13089 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_87e34b1d1990 (Metraipolis archive dc_87e34b1d1990, sha256 d84b5bcfe995d199e01e6bf577f42b1d2aa6cea9cfddd9ebfa79e617e9fe4c91)
BibTeX
@misc{dc87e34b1d1990,
title = {Infinite series of Deza graphs with strongly regular children — arXiv:2608.13089},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13089},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_87e34b1d1990; sha256 d84b5bcfe995d199e01e6bf577f42b1d2aa6cea9cfddd9ebfa79e617e9fe4c91},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13089. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A Deza graph is a regular graph in which the number of common neighbours of two distinct vertices takes at most two values, regardless of adjacency. Its children are the graphs on the same vertex set in which adjacency is determined by these two common-neighbour counts. A Deza graph is called strongly Deza if both children are strongly regular. We construct an infinite family of edge-regular strongly Deza graphs using non-degenerate quadratic forms over the field with five elements. For every odd dimension greater than three and each of the two determinant square classes, we obtain a graph on the projective points represented by vectors of norm one. Its children are complementary strongly regular graphs with the parameters of the corresponding orthogonality graph on non-isotropic points and its complement. We determine the parameters by counting solutions to systems involving the associated bilinear form. These counts also yield symmetric association schemes over finite fields of odd characteristic. Further constructions include Deza graphs in dimension four, orthogonality graphs in odd dimensions, unions of relations in even dimensions over the field with nine elements, and an odd-dimensional family over the field with thirteen elements. We also give low-dimensional examples, including one whose children are a triangular graph and its complement. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.13089 — 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-19T04:28:16.167Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).