Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices

A large number of degree-based topological indices have been pro- posed in the literature to study properties of graphs modeling molecular structures. One can wonder if all these invariants are really distinct from an extremal perspective. In this talk, we will give a clear answer for 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 ve graph families are sucient to characterize the extremal graphs of 29 of these 33 indices. In other words, the extremal properties of this set of degree-based topolog- ical indices vary very little.

Authors

Institutions

Publication Details

Journal
ORBi UMONS
Published
2025-06-30
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices

Gauvain Devillez, Valentin Dusollier
ORBi UMONS
Graph theory and applications
article

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices

Gauvain Devillez, Valentin Dusollier
article en

Abstract

A large number of degree-based topological indices have been pro- posed in the literature to study properties of graphs modeling molecular structures. One can wonder if all these invariants are really distinct from an extremal perspective. In this talk, we will give a clear answer for 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 ve graph families are sucient to characterize the extremal graphs of 29 of these 33 indices. In other words, the extremal properties of this set of degree-based topolog- ical indices vary very little.

ORBi UMONS
University of Mons (BE)
Openalex Percentile: Top 15%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.