标题:
Steiner Wiener指数与图的参数Steiner Wiener Index and Graph Parameters
作者:
刘中柱, 程晓胜
关键字:
Steiner树, Steiner Wiener指数, 点染色数, 匹配数Steiner Tree, Steiner Wiener Index, Chromatic Number, Matching Number
期刊名称:
《Advances in Applied Mathematics》, Vol.5 No.4, 2016-11-29
摘要:
本文讨论了给定点着色数和匹配数的图类中k-Steiner Wiener指数的下界，并刻画了极图。图G 的k-Steiner Wiener指数定义为图G 中任意k-点集S 的Steiner距离的d(S)和，而点集S 的Steiner距离d(S)是包含点集S 的最小子树的边的数目。
The Steiner distanced(S) of vertex setS is defined as the minimum number of edges of a tree whose vertex set contains vertex set S, and the Steiner k-Wiener index SWk(G) ofG is defined as the sum ofd(S) among all possible k-vertex setS of G. In this paper, we give the bounds ofSWk(G) in the classes of graphs with given chromatic number or matching number, and characterize the extremal graphs.