Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Alain Hertz
, Hadrien Mélot
Article (2026)
Access this document
External link
Open access to the full text at the publisher's website
Open access to the full text at the publisher's websiteAbstract
We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal ones, that is, those that maximize or minimize 33 degree-based topological indices. This study shows that five graph families are sufficient to characterize the extremal chemical graphs of 29 of these 33 indices. In other words, the extremal properties of this set of degree-based topological indices vary very little.
Uncontrolled Keywords
Research Center:
PolyPublie URL:
Journal Title
:
match Communications in Mathematical and in Computer Chemistry
(
vol.
95
,
no.
1
)
Publisher:
University of Kragujevac
Official URL:
OAI:
oai:publications.polymtl.ca:76476
ORCID
Date Deposited:
12 May 2026 10:02
Last Modified:
08 Oct 2026 19:07
Cite in APA 7:
Bonte, S., Devillez, G., Dusollier, V., Hertz, A., & Mélot, H. (2026). Extremal Chemical Graphs of Maximum Degree at Most 3 for 33 Degree-Based Topological Indices. match Communications in Mathematical and in Computer Chemistry, 95(1), 193-231. https://doi.org/10.46793/match.95-1.00125
Statistics
Dimensions
Downloads
Downloads per month over past year