Metraipolis › archive › dc_cd57eeab0b5e

The integrability of sesqui-regular graphs with smallest eigenvalue at least $-3$ — arXiv:2609.27700

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27700
License (as archived)
CC0-1.0
Archived
2026-10-08T12:00:46.087Z
SHA-256 of the archived text
4d4085c20c4ab60ffa1dd8fe6f999a8c1140ac68d45bff6a973006e204350e86
Stable URL of this page
https://metraipolis.com/documento/dc_cd57eeab0b5e

How to cite

The integrability of sesqui-regular graphs with smallest eigenvalue at least $-3$ — arXiv:2609.27700 — arXiv (en), https://arxiv.org/abs/2609.27700 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd57eeab0b5e (Metraipolis archive dc_cd57eeab0b5e, sha256 4d4085c20c4ab60ffa1dd8fe6f999a8c1140ac68d45bff6a973006e204350e86)
BibTeX
@misc{dccd57eeab0b5e,
  title = {The integrability of sesqui-regular graphs with smallest eigenvalue at least $-3$ — arXiv:2609.27700},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27700},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd57eeab0b5e; sha256 4d4085c20c4ab60ffa1dd8fe6f999a8c1140ac68d45bff6a973006e204350e86},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27700. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we prove that every connected sesqui-regular graph with parameters $(n,k,c)$, where $c\geq3$, and with smallest eigenvalue in $[-3,-2)$ is $1$-integrable if its valency is sufficiently large. The bound on $c$ is optimal: for every integer $t\geq2$, the Cartesian product of the Shrikhande graph and $K_t$ is a connected sesqui-regular graph with parameters $(16t,t+5,2)$ and smallest eigenvalue $-3$, but it is not $1$-integrable.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.27700 — 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-08T12:00:26.564Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).