Abstract
Let G be a connected graph. The Sombor index of a graph G is defined as \(SO(G)=\sum _{uv\in E(G)}\sqrt{d^2_{G}(u)+d^2_{G}(v)}\), where \(d_G(u)\) denotes the degree of u in G. Let \({\mathscr {B}}^d_n\) be the set of all bipartite graphs of diameter d with n vertices. In this paper, we determine the sharp upper bound on the Sombor index of \(G\in {\mathscr {B}}^d_n\). In addition, we propose an algorithm for searching the largest Sombor index among \({\mathscr {B}}^d_n\). Furthermore, the relationship between the maximal Sombor index of \(G\in {\mathscr {B}}^d_n\) and the diameter d is established. Finally, we obtain the largest, the second-largest, the third-largest and the smallest Sombor indices of bipartite graphs.
Similar content being viewed by others
References
Alidadi, A., Parsian, A., Arianpoor, H.: The minimum Sombor index for unicyclic graphs with fixed diameter. MATCH Commun. Math. Comput. Chem. 88, 561–572 (2022)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)
Chen, H., Li, W., Wang, J.: Extremal values on the Sombor index of trees. MATCH Commun. Math. Comput. Chem. 87, 23–49 (2022)
Chen, Y., Hua, H.: The relations between the Sombor index and Merrifield-Simmons index. Filomat 37, 4785–4794 (2022)
Cruz, R., Rada, J.: Extremal values of the Sombor index in unicyclic and bicyclic graphs. J. Math. Chem. 59, 1098–1116 (2021)
Cruz, R., Gutman, I., Rada, J.: Sombor index of chemical graphs. Appl. Math. Comput. 399, 126018 (2021)
Das, K.C., Gutman, I.: On Sombor index of trees. Appl. Math. Comput. 412, 126575 (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. MATCH Commun. Math. Comput. Chem. 86, 11–16 (2021)
Gutman, I.: Spectrum and energy of the Sombor matrix. Military Tech. Courier 69, 551–561 (2021)
Gutman, I., Gürsoy, N.K., Ülker, A.: New bounds on Sombor index. Commun. Comb. Optim. 8, 305–311 (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.: Extremal problems on Sombor indices of unicyclic graphs with a given diameter. Comput. Appl. Math. 41, 138 (2022)
Liu, H., You, L.: The spectral properties of \(p\)-Sombor (Laplacian) matrix of graphs. J. Math. Res. Appl. 43, 277–288 (2023)
Liu, H., You, L., Huang, Y.: Ordering chemical graphs by Sombor indices and its applications. MATCH Commun. Math. Comput. Chem. 87, 5–22 (2022)
Liu, H., You, L., Huang, Y., Fang, X.: Spectral properties of \(p\)-Sombor matrices and beyond. MATCH Commun. Math. Comput. Chem. 87, 59–87 (2022)
Liu, J.B., Zheng, Y., Peng, X.: The statistical analysis for Sombor indices in a random polygonal chain networks. Discrete Appl. Math. 338, 218–233 (2023)
Oboudi, M.R.: On graphs with integer Sombor index. J. Appl. Math. Comput. 69, 941–952 (2023)
Shooshtari, H., Sheikholeslami, S.M., Amjadi, J.: Modified Sombor index of unicyclic graphs with a given diameter. Asian Eur. J. Math. 16, 2350098 (2023)
Redžepović, I.: Chemical applicability of Sombor indices. J. Serb. Chem. Soc. 86, 445–457 (2021)
Sun, X., Du, J.: On Sombor index of trees with fixed domination number. Appl. Math. Comput. 421, 126946 (2022)
Wang, Z., Li, Y., Furltla, B.: On relations between Sombor and other degree-based indices. J. Appl. Math. Comput. 68, 1–17 (2022)
Zhai, M., Liu, R., Shu, J.: On the spectral radius of biparptite graphs with given diameter. Linear Algebra Appl. 430, 1165–1170 (2009)
Acknowledgements
This work is supported by the Project of Chizhou University(Grant Nos. CZ2021ZRZ03, CZ2022YJRC08, CZ2023ZRZ04), the Applied Mathematics Research Center of Chizhou University and the Hubei Provincial Natural Science Foundation and Huangshi of China (Grant Nos. 2022CFD042, 2022CFB484).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
We declare that we have no conflicts of interest.
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
Wang, Z., Gao, F., Zhao, D. et al. Sharp upper bound on the Sombor index of bipartite graphs with a given diameter. J. Appl. Math. Comput. 70, 27–46 (2024). https://doi.org/10.1007/s12190-023-01955-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-023-01955-8