三圈图的极大边修正Szeged指标
Tricyclic Graphs with Maximal Edge Revised Szeged Index
DOI: 10.12677/AAM.2020.910194, PDF,    国家自然科学基金支持
作者: 王小芳, 刘蒙蒙*：兰州交通大学数理学院，甘肃 兰州
关键词: Wiener指标；修正Szeged指标；边修正Szeged指标；三圈图；Wiener Index； Revised Szeged Index； Edge Revised Szeged Index； Tricyclic Graph
摘要: 边修正Szeged指标的定义是，其中mu(e)和mv(e)分别是到u的距离比到v的距离近的边的个数和到v的距离比到u的距离近的边的个数，m0(e)是到u和v距离相等的边数。在本文中，我们得到了连通三圈图的修正边Szeged指标的上界，并且刻画了这些图达到上界的极值。
Abstract: The edge revised Szeged index is defined as , where mu(e) and mv(e) are, respectively, the number of edges of G lying closer to vertex u than to vertex v and the number of edges of G lying closer to vertex v than to vertex u, and m0(e) is the number of edges equidistant to u and v. In this paper, we give an upper bound of the edge revised Szeged index for a connected tricyclic graphs, and also characterize those graphs that achieve the upper bound.
文章引用：王小芳, 刘蒙蒙. 三圈图的极大边修正Szeged指标[J]. 应用数学进展, 2020, 9(10): 1672-1685. https://doi.org/10.12677/AAM.2020.910194

参考文献

[1] Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory, GTM 244. Springer, Berlin. [Google Scholar] [CrossRef] 
[2] Gutman, I., Klavzar, S. and Mohar, B. (1997) Fifty Years of the Wiener Index. MATCH Communications in Mathematical and in Computer Chemistry, 35, 1-259.
[3] Gutman, I., Yeh, Y.N., Lee, S.L. and Luo, Y.L. (1993) Some Recent Results in the Theory of the Wiener Number. Indian Journal of Chemistry, 32A, 651-661.
[4] Wiener, H. (1947) Structural Determination of Paraffin Boiling Points. Journal of the American Chemical Society, 69, 17-20. [Google Scholar] [CrossRef] [PubMed]
[5] Gutman, I. (1994) A Formula for the Wiener Number of Trees and Its Extension to Graphs Containing Cycles. Graph Theory Notes of New York, 27, 9-15.
[6] Randic, M. (2002) On Generalization of Wiener Index for Cyclic Structures. Acta Chimica Slovenica, 49, 483-496. [Google Scholar] [CrossRef] 
[7] Chen, L., Li, X. and Liu, M. (2014) Tricyclic Graphs with Maximal Revised Szeged Index. Discrete Applied Mathematics, 177, 71-79. [Google Scholar] [CrossRef] 
[8] Li, X. and Liu, M. (2013) Bicyclic Graphs with Maximal Revised Szeged Index. Discrete Applied Mathematics, 161, 2527-2531. [Google Scholar] [CrossRef] 
[9] Pisanski, T. and Randic, M. (2010) Use of the Szeged Index and the Revised Szeged Index for Measuring Network Bipartivity. Discrete Applied Mathematics, 158, 1936-1944. [Google Scholar] [CrossRef] 
[10] Pisanski, T. and Zerovnik, J. (2009) Edge-Contributions of Some Topological Indices and Arboreality of Molecular Graphs. Ars Mathematica Contemporanea, 2, 49-58. [Google Scholar] [CrossRef] 
[11] Simic, S., Gutman, I. and Baltic, V. (2000) Some Graphs with Extremal Szeged Index. Mathematica Slovaca, 50, 1-15.
[12] Xing, R. and Zhou, B. (2011) On the Revised Szeged Index. Discrete Applied Mathematics, 159, 69-78. [Google Scholar] [CrossRef] 
[13] Gutman, I. and Ashrafifi, A.R. (2008) The Edge Version of the Szeged Index. Croatica Chemica Acta, 81, 263-266.
[14] Dong, H., Zhou, B. and Trinajstic, C. (2011) A Novel Version of the Edge-Szeged Index. Croatica Chemica Acta, 84, 543-545. [Google Scholar] [CrossRef] 
[15] Cai, X. and Zhou, B. (2010) Edge Szeged Index of Unicyclic Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 63, 133-144.
[16] Khalifeh, M.H., Yousefifi-Azari, H., Ashrafifi, A.R. and Gutman, I. (2008) The Edge Szeged Index of Product Graphs. Croatica Chemica Acta, 81, 277-281.
[17] Vukicevic, D. (2009) Note on the Graphs with the Greatest Edge-Szeged Index. MATCH Communications in Mathematical and in Computer Chemistry, 61, 673-681.
[18] Liu, M. and Chen, L. (2016) Bicyclic Graphs with Maximal Edge Revised Szeged Index. Discrete Applied Mathematics, 215, 225-230. [Google Scholar] [CrossRef] 

为你推荐