重庆理工大学学报（自然科学版）2018，Vol.32Issue(2)：218-224,7.DOI:10.3969/j.issn.1674-8425(z).2018.02.030
图的Wiener指数的逆区间
Inverse Interval of the Wiener Index of the Graph
摘要
Abstract
The Wiener index of connected graphs G is equal to the sum of distances between all pairs of vertices.For a given integer k,the inverse Wiener index problem is a problem of finding a graph G,such that Wiener index is equal to k.The largest inverse interval of Wiener index of graphs on n vertices is finding a positive integer interval[a,b]of biggest length,for arbitrary positive integer c in this interval,there is a graph G on n vertices that W(G)=c.They study the inverse interval problem of Wiener index of n order connected graphs and describe the double stars graph.By means of moving and connecting the hanging points on the star graph,the Wiener index of the graphs becomes continuous and the inverse interval of Wiener index increases.In the end,we present the relevant theorems and corollary.关键词
Wiener指数/逆问题/逆区间/双星图Key words
Wiener index/inverse problem/inverse interval/double stars graph分类
数理科学引用本文复制引用
胡鹏,邵燕灵,刘奇..图的Wiener指数的逆区间[J].重庆理工大学学报（自然科学版）,2018,32(2):218-224,7.基金项目
山西省自然科学基金资助项目(201601D202003) （201601D202003）
