Steiner Wiener指数与图的参数.pdf

Advances in Applied Mathematics 应用数学进展, 2016, 5(4), 747-753 Published Online November 2016 in Hans. /journal/aam /10.12677/aam.2016.54086 Steiner Wiener Index and Graph Parameters Zhongzhu Liu, Xiaosheng Cheng College of Mathematics and Data Science, Huizhou University, Huizhou Guangdong th th th Received: Nov. 10 , 2016; accepted: Nov. 25 , 2016; published: Nov. 29 , 2016 Copyright © 2016 by authors and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Open Access Abstract The Steiner distance d S of vertex set S is defined as the minimum number of edges of a tree ( ) whose vertex set contains vertex set S, and the Steiner k-Wiener index SW G of G is defined as k ( ) the sum of d S among all possible k-vertex set S of G. In this paper, we give the bounds of ( ) SW G in the classes of graphs with given chromatic number or matching number, and charac- k ( ) terize the extremal graphs. Keywords Steiner Tree, Steiner Wiener Index, Chromatic Number, Matching Number Steiner Wiener指数与图的参数 刘中柱，程晓胜 惠州学院数学与大数据学院，广东 惠州 收稿日期：2016年11月10 日；录用日期：2016年11月25 日；发布日期：2016年11月29 日 摘 要 本文讨论了给定点着色数和匹配数的图类中k-Steiner Wiener指数的下界，并刻画了极图。图G 的 文章引用: 刘中柱, 程晓胜. Steiner Wiener 指数与图的参数[J]. 应用数学进展, 2016, 5(4): 747-753. /10.12677/aam.2016.54086 刘中柱，程晓胜 k-Steiner Wiener指数定义为图G中任意k-点集S 的Steiner距离d S 的和，而点集S 的Steiner距离d S