Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.