AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (231.3 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Extremal problems on the general Sombor index of a graph

Juan C. Hernández1José M. Rodríguez2O. Rosario1José M. Sigarreta1( )
Facultad de Matemáticas, Universidad Autónoma de Guerrero, Carlos E. Adame No.54 Col. Garita, 39650 Acalpulco Gro., Mexico
Departamento de Matemáticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 28911 Leganés, Madrid, Spain
Show Author Information

Abstract

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.

CLC number: 05C09, 05C92

References

【1】
【1】
 
 
AIMS Mathematics
Pages 8330-8343

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Hernández JC, Rodríguez JM, Rosario O, et al. Extremal problems on the general Sombor index of a graph. AIMS Mathematics, 2022, 7(5): 8330-8343. https://doi.org/10.3934/math.2022464

67

Views

1

Downloads

11

Crossref

18

Web of Science

21

Scopus

Received: 29 September 2021
Revised: 04 February 2022
Accepted: 15 February 2022
Published: 15 May 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)