摘要
一个连通图G的W iener指数定义为图G中所有点对的距离之和,本文主要研究双圈图去掉一条割边后其W iener指数的下界问题,并刻画了达到下界的极值图。
The Wiener index W(G) of a graph G is defined as the sum of distances over all pairs of vertices.Let G be a bicyclic graph.In this paper,we give a lower bound for the wiener index of graph G-e respectively.Moreover,all extreme-value graphs which attain the lower boundary are characterized.
出处
《安庆师范学院学报(自然科学版)》
2011年第3期31-34,共4页
Journal of Anqing Teachers College(Natural Science Edition)
基金
安徽省高校省级自然科学研究项目(KJ2011Z236)资助