MINIMUM WIENER INDICES OF TREES AND UNICYCLIC GRAPHS OF GIVEN MATCHING NUMBER
MINIMUM WIENER INDICES OF TREES AND UNICYCLIC GRAPHS OF GIVEN MATCHING NUMBER
复制标题
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Z. Du;Bo Zhou
中科院分区：
文献类型：
--
作者：
Z. Du;Bo Zhou
连通图的Wiener指数定义为所有无序顶点对之间的距离之和。我们分别确定了树和单圈图在给定顶点数和匹配数的情况下的最小Wiener指标。给出了极图的特征。
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. We determine the minimum Wiener indices of trees and unicyclic graphs with given number of vertices and matching number, respectively. The extremal graphs are characterized.