Nordhaus-Gaddum inequality for the spectral radius of a graph of order $n$
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909647593537536 |
|---|---|
| author | Cheng, Yen-Jen Weng, Chih-wen |
| author_facet | Cheng, Yen-Jen Weng, Chih-wen |
| contents | We determine the extremal graph $G$ of order $n$ that maximizes the sum of the spectral radii of $G$ and its complement. This resolves a conjecture posed by Stevanović in 2007. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_11401 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Nordhaus-Gaddum inequality for the spectral radius of a graph of order $n$ Cheng, Yen-Jen Weng, Chih-wen Combinatorics 05C50, 15A18 We determine the extremal graph $G$ of order $n$ that maximizes the sum of the spectral radii of $G$ and its complement. This resolves a conjecture posed by Stevanović in 2007. |
| title | Nordhaus-Gaddum inequality for the spectral radius of a graph of order $n$ |
| topic | Combinatorics 05C50, 15A18 |
| url | https://arxiv.org/abs/2506.11401 |