Extremal Chemical Graphs for the Arithmetic-Geometric Index
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909132505743360 |
|---|---|
| author | Hertz, Alain Bonte, Sébastien Devillez, Gauvain Dusollier, Valentin Mélot, Hadrien Schindl, David |
| author_facet | Hertz, Alain Bonte, Sébastien Devillez, Gauvain Dusollier, Valentin Mélot, Hadrien Schindl, David |
| contents | The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the connected chemical graphs that reach the bound. We also prove that the removal of the constraint that extremal chemical graphs must be connected does not allow to increase the upper bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_05226 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Extremal Chemical Graphs for the Arithmetic-Geometric Index Hertz, Alain Bonte, Sébastien Devillez, Gauvain Dusollier, Valentin Mélot, Hadrien Schindl, David Combinatorics Discrete Mathematics The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the connected chemical graphs that reach the bound. We also prove that the removal of the constraint that extremal chemical graphs must be connected does not allow to increase the upper bound. |
| title | Extremal Chemical Graphs for the Arithmetic-Geometric Index |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2403.05226 |