Збережено в:
| Автори: | , , , , |
|---|---|
| Формат: | Preprint |
| Опубліковано: |
2025
|
| Предмети: | |
| Онлайн доступ: | https://arxiv.org/abs/2501.02246 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Зміст:
- We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal graphs, meaning those that maximize or minimize 33 degree-based topological indices. This study shows that five graph families are sufficient to characterize the extremal graphs of 29 of these 33 indices. In other words, the extremal properties of this set of degree-based topological indices vary very little.