关于单圈图的Wiener指数

On the Wiener Index of Unicyclic Graphs

一个连通图G的Wiener指数W(G)是指图G中所有顶点对之间距离之和。主要研究单圈图去掉一条割边后其Wiener指数的上界和下界问题,并刻画了达到上界和下界的所有极图。

Let G be a connected graph.The Wiener index W（G） is the sum of distances between all pairs of vertices.Let G be a unicylic graph.In this paper,we give a lower bound and an upper bound for the Wiener index of graph G-e respectively.Moreover,all extremal graphs which attain the lower and upper bound are characterized.