Metraipolis › archive › dc_8dfdfaab1d27
The minimum spectral radius of maximal outerplanar graphs — arXiv:2609.33333
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33333
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:29:03.324Z
- SHA-256 of the archived text
8cf52eaf06029e7dc07d987e49024fe00ac868008a2f1e0e6342df5dccd2fdff- Stable URL of this page
https://metraipolis.com/documento/dc_8dfdfaab1d27
How to cite
The minimum spectral radius of maximal outerplanar graphs — arXiv:2609.33333 — arXiv (en), https://arxiv.org/abs/2609.33333 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8dfdfaab1d27 (Metraipolis archive dc_8dfdfaab1d27, sha256 8cf52eaf06029e7dc07d987e49024fe00ac868008a2f1e0e6342df5dccd2fdff)
BibTeX
@misc{dc8dfdfaab1d27,
title = {The minimum spectral radius of maximal outerplanar graphs — arXiv:2609.33333},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33333},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8dfdfaab1d27; sha256 8cf52eaf06029e7dc07d987e49024fe00ac868008a2f1e0e6342df5dccd2fdff},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33333. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An outerplanar graph is \emph{maximal} if no edge can be added without losing outerplanarity. Lin and Ning determined the outerplanar graph with the largest spectral radius, and the maximizer is a maximal outerplanar graph. We determine the minimizer. In this paper, we prove that every $n$-vertex maximal outerplanar graph $G$ satisfies $\rho(G)\ge\rho(F_n)$, where $F_n$ is the zig-zag triangulation of the $n$-gon, that is, the square of the path on $n$ vertices, with equality if and only if $G=F_n$. The proof uses three local operations on maximal outerplanar graphs, each of which strictly decreases the spectral radius: the first reverses the way a piece is attached along a chord, and the second and third move a piece from one vertex to its twin across a chord when the twin carries nothing or a single ear, respectively. A graph at which no operation applies is $F_n$, or has spectral radius greater than $4$, or consists of a central triangle with three zig-zag blades of at least three triangles each and has at most $15$ vertices; in the last case it contains one of two explicit graphs on $12$ vertices whose spectral radius exceeds that of $F_{15}$. Since $\rho(F_n)<4$ for all $n$, this completes the proof. The numerical inequalities used along the way are certified by explicit integer vectors with small entries.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.33333 — 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-07T23:08:10.801Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).