On the maximum spectral radius of connected graphs with a prescribed order and size
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914274058698752 |
|---|---|
| author | Damnjanović, Ivan |
| author_facet | Damnjanović, Ivan |
| contents | The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let $\mathcal{C}_{n, e}$ be the set of all the connected simple graphs with $n$ vertices and $n - 1 + e$ edges. Here, we solve the spectral radius maximization problem on $\mathcal{C}_{n, e}$ when $e \le 130$ or $n \ge e + 2 + 13\sqrt{e}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_17883 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the maximum spectral radius of connected graphs with a prescribed order and size Damnjanović, Ivan Combinatorics 05C50, 05C35 The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let $\mathcal{C}_{n, e}$ be the set of all the connected simple graphs with $n$ vertices and $n - 1 + e$ edges. Here, we solve the spectral radius maximization problem on $\mathcal{C}_{n, e}$ when $e \le 130$ or $n \ge e + 2 + 13\sqrt{e}$. |
| title | On the maximum spectral radius of connected graphs with a prescribed order and size |
| topic | Combinatorics 05C50, 05C35 |
| url | https://arxiv.org/abs/2503.17883 |