The Wiener index of the kth power of a graph

详细信息	查看全文 | 推荐本文 |

• 作者：Xinhui An ; Baoyindureng Wu
• 关键词：Wiener index ; none ; color ; black" href="/science?_ob=MathURL&_method=retrieve&_udi=B6TY9-4P1X7GN-3&_mathId=mml15&_user=1067359&_cdi=5613&_rdoc=4&_acct=C000050221&_version=1&_userid=10&md5=62741a2cad7b0d940713f0
• 刊名：Applied Mathematics Letters
• 出版年：2008
• 期刊代码：5_08939659
• 类别：mt
• 出版时间：May 2008
• 卷：21
• 期：5
• 页码：436-440
• 文件大小：288 K

摘要

The kth power of a graph G, denoted by G^k, is a graph with the same vertex set as G such that two vertices are adjacent in G^k if and only if their distance is at most k in a406538705d804b7a0d816f67" title="Click to view the MathML source" alt="Click to view the MathML source">G. The Wiener index is a distance-based topological index defined as the sum of distances between all pairs of vertices in a graph. In this note, we give the bounds on the Wiener index of the graph G^k. The Nordhaus–Gaddum-type inequality for the Wiener index of the graph 8a406f14b1" title="Click to view the MathML source" alt="Click to view the MathML source">G^k is also presented.