Abstract
The revised Szeged index of a connected graph G is defined as
where E(G) is the edge set of G, and for any \(e = uv\in E(G)\), \(n_u(e|G)\) is the number of vertices of G lying closer to vertex u than to v, \(n_v(e|G)\) is the number of vertices of G lying closer to vertex v than to u, and \(n_0(e|G)\) is the number of vertices with equal distances from both end vertices of the edge e. In this paper, we characterize the graph with the minimum revised Szeged index among all the unicyclic graphs with given order and diameter.
Similar content being viewed by others
References
Aouchiche, M., Hansen, P.: On a conjecture about the Szeged index. Eur. J. Comb. 31, 1662–1666 (2010)
Chen, L., Li, X., Liu, M.: Tricyclic graphs with maximal revised Szeged index. Discrete Appl. Math. 177, 71–79 (2014)
Chen, L., Li, X., Liu, M.: The (revised) Szeged index and the Wiener index of a nonbipartite graph. Eur. J. Comb. 36, 237–246 (2014)
Chen, Y.H., Zhang, X.D.: The Wiener index of unicyclic graphs with girth and the matching number. Ars Comb. 106, 115–128 (2012)
Chen, J., Li, S.C., Zhang, H.H.: On the quotients between the (revised) Szeged index and wiener index of graphs. Discrete Math. Theor. Comput. Sci. 19, 12–25 (2017)
Deng, H.Y., Xiao, H.: The maximum Wiener polarity index of trees with \(k\) pendents. Appl. Math. Lett. 23, 710–715 (2010)
Dobrynin, A., Entringer, R., Gutman, I.: Wiener index of trees: theory and application. Acta Appl. Math. 66, 211–249 (2001)
Gutman, I.: A formula for the Wiener number of trees and its extension to graphs containing cycles. Graph Theory Notes NY 27, 9–15 (1994)
Gutman, I., Khadikar, P.V., Rajput, P.V., Karmarkar, S.: The Szeged index of polyacenes. J. Serb. Chem. Soc. 60, 759–764 (1995)
Gutman, I., Klavžar, S., Mohar, B.: Fifty years of the Wiener index. MATCH Commun. Math. Comput. Chem. 35, 1–259 (1997)
Gutman, I., Yeh, Y.N., Lee, S.L., Luo, Y.L.: Some recent results in the theory of the Wiener number. Indian J. Chem. 32A, 651–661 (1993)
Hong, Y., Liu, M., Wang, J.: The lower bound of revised Szeged index with respect to tricyclic graphs. MATCH Commun. Math. Comput. Chem. 79, 757–778 (2018)
Li, S.C., Zhang, H.H.: Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond. Discrete Math. 340, 311–324 (2017)
Ji, S., Liu, M., Wu, J.: A lower bound of revised Szeged index of bicyclic graphs. Appl. Math. Comput. 316, 480–487 (2018)
Khadikar, P.V., Karmarkar, S., Agrawal, V.K., Singh, J., Shrivastava, A., Lukovits, I., Diudea, M.V.: Szeged index-applications for drug modeling. Lett. Drug Design Discov. 2, 606–624 (2005)
Sandi, Klavžar, Li, S.C., Zhang, H.H.: On the difference between the (revised) Szeged index and the Wiener index of cacti. Discrete Appl. Math. 247, 77–89 (2018)
Klavžar, S., Nadjafi-Arani, M.J.: On the difference between the revised Szeged index and the Wiener index. Discrete Math. 333, 28–34 (2014)
Klavžar, S., Rajapakse, A., Gutman, I.: The Szeged and the Wiener index of graphs. Appl. Math. Lett. 9, 45–49 (1996)
Li, X., Liu, M.: Bicyclic graphs with maximal revised Szeged index. Discrete Appl. Math. 161, 2527–2531 (2013)
Liu, H.Q., Pan, X.F.: On the Wiener index of trees with fixed diameter. MATCH Commun. Math. Comput. Chem. 60, 85–94 (2008)
Liu, Y., Yu, A.M., Lu, M., Hao, R.-X.: On the Szeged index of unicyclic graphs with given diameter. Discrete Appl. Math. 233, 118–130 (2017)
Pisanski, T., Randic, M.: Use of the Szeged index and the revised Szeged index for meauring network bipartivity. Discrete Appl. Math. 158, 1936–1944 (2010)
Pisanski, T., Zerovnik, J.: Edge-contributions of some topological indices and arboreality of molecular graphs. Ars Math. Contemp. 2, 49–58 (2009)
Randić, M.: On generalization of Wiener index for cyclic structures. Acta Chim. Slov. 49, 483–496 (2002)
Ren, C.R., Shi, J.S.: On the Wiener index of unicyclic graphs with fixed diameter. J. East China Univ. Sci. Technol. 39, 768–772 (2013)
Simić, S., Gutman, I., Baltić, V.: Some graphs with extremal Szeged index. Math. Slovaca 50, 1–15 (2000)
Tan, S.W.: The minimum Wiener index of unicyclic graphs with a fixed diameter. J. Appl. Math. Comput. 56, 93–114 (2018)
Wang, S.J.: On extremal cacti with respect to the revised Szeged index. Discrete Appl. Math. 233, 231–239 (2017)
Xing, R., Zhou, B.: On the revised Szeged index. Discrete Appl. Math. 159, 69–78 (2011)
Zhang, H.H., Li, S.C., Zhao, L.F.: On the further relation between the (revised) Szeged index and wiener index. Discrete Appl. Math. 206, 152–164 (2016)
Zhou, B., Cai, X., Du, Z.: On Szeged indices of unicyclic graphs. MATCH Commun. Math. Comput. Chem. 63, 113–132 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Sanming Zhou.
The research is partially supported by Fundamental Research Funds for the Central Universities of China (No. 2015JBM107), the 111 Project of China (B16002) and the National Natural Science Foundation of China (Nos. 11771039, 11731002).
Rights and permissions
About this article
Cite this article
Yu, A., Peng, K., Hao, RX. et al. On the Revised Szeged Index of Unicyclic Graphs with Given Diameter. Bull. Malays. Math. Sci. Soc. 43, 651–672 (2020). https://doi.org/10.1007/s40840-018-00706-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40840-018-00706-4