摘要
一个图G的Wiener指数W(G)定义为G中所有点对的距离和,双圈图是一个具有n个点和n+1条边的连通图,我们根据两个圈的相对位置关系把双圈图分成三类,分别在这三类中给出了最小的Wiener指数,然后通过比较三类极值的大小得到了双圈图中具有最小Wiener指数的图。
The Wiener index W(G) of a graph G is defined as the sum of distances over all pairs of vertices. Bicyclic graphis a connected simple graph n with n + 1 vertices and edges. According to the locational relation of the two cycles, we divide bicyelie graphs into three subsets, and their bicyclic graphs with minimum Wiener index in this subsets are given, respectively. By comparing the Wiener index of graphs with extremal value in those sets, we obtain bicyclic grahs with minimum Wiener index.
出处
《安庆师范学院学报(自然科学版)》
2009年第3期8-12,共5页
Journal of Anqing Teachers College(Natural Science Edition)