The Minimal Trees of Steiner Wiener Index with Given Matching Number

本文讨论了给定匹配数的树中k-Steiner Wiener指数的极小值，并刻画了极图。图G的k-Steiner Wiener指数定义为图G中任意k-点集S的Steiner距离d(S)的和，而点集S的Steiner距离d(S) 是包含点集S的最小子树的边的数目。 The Steiner distance d(S) of a vertex set S is defined as the minimum number of edges of a tree whose vertex set contains a vertex set S, and the Steiner k-Wiener index SKW(G) of G is defined as the sum of d(S) among all possible k-vertex set S of G. In this paper, we determine the minimal value of SKW(G) in the class of trees with given matching number.