Steiner k-general Wiener index of unicyclic graphs
王笑 1耿显亚1
扫码查看
点击上方二维码区域，可以放大扫码查看
作者信息
1. 安徽理工大学数学与大数据学院,安徽淮南 232001
折叠
摘要
对于连通图G,当3≤k≤n-2 时,图G的Steiner k-general Wiener 指数定义为SWmk(G)=∑S(∈)V(G)|S|=kdm(S),(m≥1),其中d(S)表示点集S的Steiner距离,即图G中包含点集S的最小连通子树的边数.给出了单圈图的SWmk(G)下界,并得到对应的极图.
Abstract
For a connected graph G,when 3≤k≤n-2,the Steiner k-general Wiener index of graph G was defined as SWmk(G)=∑S(∈)V(G)|S|=kdm(S),(m≥1),where d(S)was the Steiner distance of,means the minimum size of a connected subgraph which vertex set contains.In this paper,the SWmk(G)lower bound of unicycle graph was given and the corresponding ex-tremal graph was obtained.
维普
万方数据