摘要
一个简单有限连通图G的所有无序顶点对之间的距离之和称为G的Wiener指数,用W(G)来表示.主要研究了一类给定阶数的路的强乘积Wiener指数,利用强乘积图的结构特征,刻画了当路径长度为奇数时,两条路强乘积的精确Wiener指数.除此之外,还给出了两条路强乘积边转发指数的一个上界.
The sum of the distances between all unordered vertex pairs of a simple finite connected graph G is called the Wiener index of G,which is given by W(G).In this paper,we mainly research the Wiener index of the strong product of a class of paths with given order.By using the structural characteristics of the strong product graph,we obtain the exact Wiener index of the strong product of two paths when the length of both paths is odd.In addition,we also give an upper bound for the edge forwarding index of the strong product of two paths.
作者
段世杰
李峰
DUAN Shi-jie;LI Feng(College of Computer Science Qinghai Normal University,Xining 810000,China;Key Laboratory of Tibetan Information Processing,Ministry of Education,Xining 810000,China;Tibetan Information Processing and Machine Translation Key Laboratory of Qinghai Province,Xining 810000,China)
出处
《数学的实践与认识》
2021年第20期156-169,共14页
Mathematics in Practice and Theory
基金
国家自然科学基金(11551002)
青海省自然科学基金(2019-ZJ-7093)。