Metraipolis › archive › dc_42d787cdbdab
Connected graphs with minimum adjacency spectral gap — arXiv:2609.37774
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37774
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:44.048Z
- SHA-256 of the archived text
064f96fa98b433e357bdd90dc9f722b167a04173341f4f510d3adc060d63ba41- Stable URL of this page
https://metraipolis.com/documento/dc_42d787cdbdab
How to cite
Connected graphs with minimum adjacency spectral gap — arXiv:2609.37774 — arXiv (en), https://arxiv.org/abs/2609.37774 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_42d787cdbdab (Metraipolis archive dc_42d787cdbdab, sha256 064f96fa98b433e357bdd90dc9f722b167a04173341f4f510d3adc060d63ba41)
BibTeX
@misc{dc42d787cdbdab,
title = {Connected graphs with minimum adjacency spectral gap — arXiv:2609.37774},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37774},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_42d787cdbdab; sha256 064f96fa98b433e357bdd90dc9f722b167a04173341f4f510d3adc060d63ba41},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37774. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a connected graph, and let $\lambda_1(G) > \lambda_2(G)$ denote its two largest adjacency eigenvalues. The spectral gap of $G$ is defined as the difference $\lambda_1(G) - \lambda_2(G)$. For integers $r\geq 2$ and $s\geq 0$, the double kite $DK(r,s)$ is formed by taking two vertex-disjoint copies of the complete graph $K_r$ and joining one specified vertex of each clique to a path with $s$ internal vertices. Stanić (2013) conjectured that every connected $n$-vertex graph with minimum adjacency spectral gap is a double kite. In this paper, we confirm this conjecture for sufficiently large $n$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.37774 — 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-07T17:59:19.234Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).