The extremal generalised Randić index for a given degree range
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913294726463488 |
|---|---|
| author | Haslegrave, John |
| author_facet | Haslegrave, John |
| contents | O and Shi proved that the Randić index of any graph $G$ with minimum degree at least $δ$ and maximum degree at most $Δ$ is at least $\frac{\sqrt{δΔ}}{δ+Δ}|G|$, with equality if and only if the graph is $(δ,Δ)$-biregular. In this note we give a short proof via a more general statement. We apply the latter to classify the graphs in any given degree range which minimise (or maximise) the generalised Randić index for any exponent, and describe the transitions between different types of behaviour precisely. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_01346 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The extremal generalised Randić index for a given degree range Haslegrave, John Combinatorics 05C09 (Primary) 05C07, 05C35 (Secondary) O and Shi proved that the Randić index of any graph $G$ with minimum degree at least $δ$ and maximum degree at most $Δ$ is at least $\frac{\sqrt{δΔ}}{δ+Δ}|G|$, with equality if and only if the graph is $(δ,Δ)$-biregular. In this note we give a short proof via a more general statement. We apply the latter to classify the graphs in any given degree range which minimise (or maximise) the generalised Randić index for any exponent, and describe the transitions between different types of behaviour precisely. |
| title | The extremal generalised Randić index for a given degree range |
| topic | Combinatorics 05C09 (Primary) 05C07, 05C35 (Secondary) |
| url | https://arxiv.org/abs/2402.01346 |