Extremal values on the Sombor index of trees
Hanlin Chen, Wenhao Li, Jing Wang
Abstract
The Sombor index of a graph is defined as where denote the degree of the vertex in . In this article, we determine the extremal values of the Sombor index of trees with some given parameters, including matching number, pendant vertices, diameter, segment number, branching number, etc. The corresponding extremal trees are characterized completely.
Topics & Concepts
CombinatoricsMathematicsBranching (polymer chemistry)Vertex (graph theory)Index (typography)Wiener indexGraphMatching (statistics)Topological indexDiscrete mathematicsStatisticsComputer scienceChemistryOrganic chemistryWorld Wide WebGraph theory and applicationsSynthesis and Properties of Aromatic CompoundsZeolite Catalysis and Synthesis