Connected graphs minimizing the spectral radius for given order and dissociation number
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914404322246656 |
|---|---|
| author | Huang, Zejun Liu, Jiahui Yang, Chenxi |
| author_facet | Huang, Zejun Liu, Jiahui Yang, Chenxi |
| contents | A dissociation set in a graph is a subset of vertices which induces a subgraph with maximum degree at most one. The dissociation number of a graph is the maximum cardinality of its dissociation sets. In this paper, we consider the $n$-vertex connected graphs with a given dissociation number that attain the minimum spectral radius. By using structure analysis and constructing difference equations, we characterize the extremal graphs with dissociation number $n-3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14791 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Connected graphs minimizing the spectral radius for given order and dissociation number Huang, Zejun Liu, Jiahui Yang, Chenxi Combinatorics A dissociation set in a graph is a subset of vertices which induces a subgraph with maximum degree at most one. The dissociation number of a graph is the maximum cardinality of its dissociation sets. In this paper, we consider the $n$-vertex connected graphs with a given dissociation number that attain the minimum spectral radius. By using structure analysis and constructing difference equations, we characterize the extremal graphs with dissociation number $n-3$. |
| title | Connected graphs minimizing the spectral radius for given order and dissociation number |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.14791 |