给定团数的Wiener指数极图
On the Extremal Wiener Indices of Graphs with Given Clique Number
DOI: 10.12677/AAM.2019.86134, PDF,    科研立项经费支持
作者: 陈员龙, 吴小英：广东金融学院金融数学与统计学院，广东 广州
关键词: 图；Wiener指数；极图；团数；Graph； Wiener Index； Extremal Graphs； Clique Number
摘要: 本文研究一类给定团数的连通图的Wiener指数，讨论和刻画了团数为l的n阶连通图的Wiener指数的上界和下界，通过移接变形等方法证明了团数为l的n阶连通图中具有最大，最小Wiener指数的极值图分别为KluPn-l+1与Tuŕan图。
Abstract: In this paper, we investigate the Wiener index for connected graphs of given clique number, obtain sharp lower and upper bounds on Wiener index for connected graphs of order n with clique number l. For connected graphs of order n with clique number l, by the method of shift-joint deformation, we obtain the largest Wiener index graph and the smallest Wiener index graph are KluPn-l+1 and Tuŕan graph, respectively.
文章引用：陈员龙, 吴小英. 给定团数的Wiener指数极图[J]. 应用数学进展, 2019, 8(6): 1160-1165. https://doi.org/10.12677/AAM.2019.86134

参考文献

[1] Entringer, R. and Jackson, D. (1976) Snyder D Distance in Graphs. Czechoslovak Mathematical Journal, 26, 283-296.
[2] You, Z.-F., Huang, Y. and Du, X. (2018) A Note on Comparison between the Wiener Index and the Za-greb Indices. Communications in Mathematical Research, 34, 296-302.
[3] Das, K.C. and Nadjafi-Arani, M.J. (2017) On Maximum Wiener Index of Trees and Graphs with Given Radius. Journal of Combinatorial Optimization, 34, 574-587. [Google Scholar] [CrossRef] 
[4] Gutman, I. and Yeh, Y.N. (1995) The Sum of All Dis-tances in Bipartite Graphs. Mathematica Slovaca, 45, 327-334.
[5] Berega, S. and Wang, H. (2007) Wiener Indices of Balanced Binary Trees. Discrete Applied Mathematics, 155, 457-467. [Google Scholar] [CrossRef] 
[6] Czabarkaě, E., Szěkely, L. and Wagner, S. (2009) The Inverse Problem for Certain Tree Parameters. Discrete Applied Mathematics, 157, 3314-3319. [Google Scholar] [CrossRef] [PubMed]
[7] Li, X.L. and Wang, L. (2004) Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids. SIAM Journal on Discrete Mathematics, 17, 210-218. [Google Scholar] [CrossRef] 
[8] Wu, X.Y. and Liu, H.Q. (2010) On the Wiener Index of Graphs. Acta Applicandae Mathematicae, 110, 535-544. [Google Scholar] [CrossRef] 
[9] Liu, H.Q. and Pan, X.F. (2008) Minimal Wiener Index of Trees with Fixed Diameter. MATCH Communications in Mathematical and in Computer Chemistry, 60, 85-94.
[10] Dimitrov, D., Ikica, B. and Škrekovski, R. (2019) Maximum External Wiener Index of Graphs. Discrete Applied Mathematics, 257, 331-337. [Google Scholar] [CrossRef] 
[11] Lepovic, M. and Gutman, I. (1998) A Collective Property of Trees and Chemical Trees. Journal of Chemical Information and Modeling, 38, 823-826. [Google Scholar] [CrossRef] 
[12] Goldman, D., Istrail, S., Lancia, G., Piccolboni, A. and Walenz, B. (2000) Algorithmic Strategies in Combinatorial Chemistry. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 275-284.
[13] Wagner, S. (2006) A Class of Trees and Its Wiener Index. Acta Applicandae Mathematicae, 91, 119-132. [Google Scholar] [CrossRef] 
[14] Ban, Y.-E.A., Bespamyatnikh, S. and Mustafa, N.H. (2004) A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica, 40, 99-117. [Google Scholar] [CrossRef] 
[15] Wang, H. (2008) The Extremal Values of the Wiener Index of a Tree with Given Degree Sequence. Discrete Applied Mathematics, 156, 2647-2654. [Google Scholar] [CrossRef] 

为你推荐