超树的Wiener指数的下界  

A Lower Bound on the Wiener Index of Hypertrees

作　　者：翁伟明 WENG Wei-ming(Guangdong Polytechnic Normal University,Guangzhou Guangdong 510665)

机构地区：[1]广东技术师范大学数学与系统科学学院,广东广州510665

出　　处：《广东技术师范大学学报》2021年第3期60-62,共3页Journal of Guangdong Polytechnic Normal University

基　　金：广东省基础与应用基础研究基金(2021A1515012046);国家自然科学青年基金项目(11801097)。

摘　　要：连通超图H的Wiener指数是指H中任何不同两点的距离之和本文研究了改变超图的Wiener指数的几种超图变换,并利用这些变换给出了具有n个顶点m条边的超树的Wiener指数的下界及对应超树,以及给定n个顶点的超树前三小Wiener指数及对应超树.The Wiener index of a connected hypergraph H is the sum of distances between all pairs of vertices of the hypergraph.Several local transformations on a hypergraph that decrease or increase the Wiener index are proposed.The minimum Wiener index of hypertrees with n vertices and m edges is determined.The first three smallest Wiener indexes over all hypertrees on n vertices are also presented.In addition,hypertrees attaining such Wiener indexes are characterized.

关 键 词：超图 超树 WIENER指数 

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