Metraipolis › archive › dc_a9cf3aced390
Minimizing the spectral radius of unicyclic graphs with fixed order and dissociation number — arXiv:2610.38539
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38539
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:37:43.236Z
- SHA-256 of the archived text
1e82d04836e8df303cfb58f383813e93826db23307f4107393ae2fe75a666c84- Stable URL of this page
https://metraipolis.com/documento/dc_a9cf3aced390
How to cite
Minimizing the spectral radius of unicyclic graphs with fixed order and dissociation number — arXiv:2610.38539 — arXiv (en), https://arxiv.org/abs/2610.38539 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a9cf3aced390 (Metraipolis archive dc_a9cf3aced390, sha256 1e82d04836e8df303cfb58f383813e93826db23307f4107393ae2fe75a666c84)
BibTeX
@misc{dca9cf3aced390,
title = {Minimizing the spectral radius of unicyclic graphs with fixed order and dissociation number — arXiv:2610.38539},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38539},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a9cf3aced390; sha256 1e82d04836e8df303cfb58f383813e93826db23307f4107393ae2fe75a666c84},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38539. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A dissociation set of a graph G is a vertex subset S contained in V(G) such that the induced subgraph G[S] has maximum degree at most 1, and the dissociation number of G is the cardinality of a maximum dissociation set denoted by {\Phi}(G). In this paper, we first derive a sharp lower bound on the dissociation number for all unicyclic graphs. Furthermore, we also study the graphs with minimum spectral radius among all unicyclic graphs with given order and dissociation number and explicitly identify all extremal graphs for \(n-4 \le \Phi(G) \le n-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/2610.38539 — 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-01T02:15:28.253Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).