Litcius/Paper detail

Extremal problems on the general Sombor index of a graph

J. Hernandez, Facultad de Matemáticas, Universidad Autónoma de Guerrero, Carlos E. Adame No.54 Col. Garita, 39650 Acalpulco Gro., Mexico, José M. Rodrı́guez, Omar Rosario, José M. Sigarreta, Departamento de Matemáticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 28911 Leganés, Madrid, Spain

2022AIMS Mathematics13 citationsDOIOpen Access PDF

Abstract

<abstract><p>In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, we get inequalities for these indices relating them with other indices: the first Zagreb index, the forgotten index and the first variable Zagreb index. Finally, we solve some extremal problems for general Sombor indices.</p></abstract>

Topics & Concepts

Index (typography)MathematicsGraphVariable (mathematics)CombinatoricsStatisticsMathematical economicsComputer scienceMathematical analysisWorld Wide WebGraph theory and applicationsSynthesis and Properties of Aromatic CompoundsComputational Drug Discovery Methods
Extremal problems on the general Sombor index of a graph | Litcius