Author:
MUKWEMBI SIMON,VETRÍK TOMÁŠ
Abstract
AbstractThe long-standing open problem of finding an upper bound for the Wiener index of a graph in terms of its order and diameter is addressed. Sharp upper bounds are presented for the Wiener index, and the related degree distance and Gutman index, for trees of order$n$and diameter at most$6$.
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. Some extremal properties of the degree distance of a graph
2. Spanning trees with many leaves and average distance;DeLaViña;Electron. J. Combin.,2008
3. On diameter and average distance of graphs;Zhou;OR Trans.,2004
4. The minimum degree distance of graphs of given order and size
5. Bounds on Gutman index;Andova;MATCH Commun. Math. Comput. Chem.,2012
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献