Abstract
The Sombor index is one of the geometry-based descriptors, which was defined as
where \(d_{u}\) (resp. \(d_{v}\)) denotes the degree of vertex u (resp. v) in G. In this note, we determine the graphs among the set of graphs with vertex connectivity (resp. edge connectivity) at most k having the maximum and minimum Sombor indices, which solves an open problem on the Sombor index proposed by Hayat and Rehman [On Sombor index of graphs with a given number of cut-vertices, MATCH Commun. Math. Comput. Chem. 89 (2023) 437–450]. For some conclusions of the above paper, we first give some counterexamples, then provide another simple proof about the minimum Sombor indices of graphs with n vertices, k cut vertices and at least one cycle.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)
Cruz, R., Gutman, I., Rada, J.: Sombor index of chemical graphs. Appl. Math. Comput. 399, 126018 (2021)
Chen, H., Li, W., Wang, J.: Extremal values on the Sombor index of trees. MATCH Commun. Math. Comput. Chem. 87, 23–49 (2022)
Deng, H., Tang, Z., Wu, R.: Molecular trees with extremal values of Sombor indices. Int. J. Quantum. Chem. 121, e26622 (2021)
Gutman, I.: Geometric approach to degree-based topological indices: Sombor indices. MATCH Commun. Math. Comput. Chem. 86, 11–16 (2021)
Gutman, I.: Sombor index-one year later. Bull. Acad. Serb. Sci. Arts (Cl. Sci. Math. Natur. 153, 43–55 (2020)
Gutman, I.: Some basic properties of Sombor indices, Open J. Discr. Appl. Math. 4, 1–3 (2021)
Hayat, S., Rehman, A.: On Sombor index of graphs with a given number of cut-vertices. MATCH Commun. Math. Comput. Chem. 89, 437–450 (2023)
Li, S., Wang, Z., Zhang, M.: On the extremal Sombor index of trees with a given diameter. Appl. Math. Comput. 416, 126731 (2022)
Liu, H., Gutman, I., You, L., Huang, Y.: Sombor index: review of extremal results and bounds. J. Math. Chem. 60, 771–798 (2022)
Liu, H., You, L., Huang, Y., Tang, Z.: On extremal Sombor indices of chemical graphs, and beyond. MATCH Commun. Math. Comput. Chem. 89, 415–436 (2023)
Acknowledgements
This research is partially supported by the National Natural Science Foundation of China (Grant No. 11971180), the Guangdong Provincial Natural Science Foundation (Grant No. 2019A1515012052), the Characteristic Innovation Project of General Colleges and Universities in Guangdong Province (Grant No. 2022KTSCX225) and the Guangdong Education and Scientific Research Project (Grant No. 2021GXJK159).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no conflicts of interest in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Liu, H. Proof of an open problem on the Sombor index. J. Appl. Math. Comput. 69, 2465–2471 (2023). https://doi.org/10.1007/s12190-023-01843-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-023-01843-1