On Wiener Index of Power of Paths and Cycles  

路和圈的幂图的Wiener指标

作　　者：LIU Sai-hua LI Xiao-rong 刘赛华;李晓蓉

机构地区：[1]School of Mathematics and Computational Science,Wuyi University,Jiangmen 529020,China

出　　处：《Chinese Quarterly Journal of Mathematics》2025年第1期49-58,共10页数学季刊(英文版)

基　　金：Supported by National Natural Science Foundation of China(Grant No.12201471);the Special Foundation in Key Fields for Universities of Guangdong Province(Grant No.2022ZDZX1034).

摘　　要：The Wiener index of a graph is defined to be the sum of the distances of all pairs of vertices in the graph.The kth power G^(k) of a graph G is the graph on V(G)and two vertices are adjacent if and only if their distance in G is less or equal to k.In this paper,we computed the Wiener index of the kth power of paths and cycles for any k≥2.

关 键 词：Wiener index kth power of a path kth power of a cycle 

分 类 号：O157.5[理学—数学]