Metraipolis › archive › dc_22eb4f96899b
Maxima of the Q-index: Forbidden an odd wheel — arXiv:2611.00817
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00817
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:49:31.813Z
- SHA-256 of the archived text
25ef693948e9207d8da730d319857a94767960411640d9d1cbd999334a652c0d- Stable URL of this page
https://metraipolis.com/documento/dc_22eb4f96899b
How to cite
Maxima of the Q-index: Forbidden an odd wheel — arXiv:2611.00817 — arXiv (en), https://arxiv.org/abs/2611.00817 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_22eb4f96899b (Metraipolis archive dc_22eb4f96899b, sha256 25ef693948e9207d8da730d319857a94767960411640d9d1cbd999334a652c0d)
BibTeX
@misc{dc22eb4f96899b,
title = {Maxima of the Q-index: Forbidden an odd wheel — arXiv:2611.00817},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00817},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_22eb4f96899b; sha256 25ef693948e9207d8da730d319857a94767960411640d9d1cbd999334a652c0d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00817. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In 2013, Freitas, Nikiforov and Patuzzi (EJLA, 2013) proposed the problem of determining the maximum signless Laplacian spectral radius of an $n$-vertex $F$-free graph. Recently, Yuan, Zhai and Zhang (LAA, 2026) determined the maximum signless Laplacian spectral radius of graphs without wheels of sufficiently large order. In this paper, we consider the problem of forbidding a single wheel $W_{2k+1}=K_1\vee C_{2k}$. We show that, for every fixed integer $k\ge 3$ and sufficiently large $n$, the unique extremal graph maximizing the signless Laplacian spectral radius among all $n$-vertex $W_{2k+1}$-free graphs is $K_k\vee(K_2\cup(n-k-2)K_1)$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.00817 — 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-11-03T18:15:38.051Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).