WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
- 19 September 2013
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 89 (3) , 379-396
Abstract
The 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$ .
Keywords
This publication has 8 references indexed in Scilit:
- On the eccentric connectivity index of a graphDiscrete Mathematics, 2011
- On the degree distance of a graphDiscrete Applied Mathematics, 2009
- The edge-Wiener index of a graphDiscrete Mathematics, 2009
- The minimum degree distance of graphs of given order and sizeDiscrete Applied Mathematics, 2008
- Spanning Trees with Many Leaves and Average DistanceThe Electronic Journal of Combinatorics, 2008
- Some extremal properties of the degree distance of a graphDiscrete Applied Mathematics, 1999
- Selected properties of the Schultz molecular topological indexJournal of Chemical Information and Computer Sciences, 1994
- Molecular topological index: a relation with the Wiener indexJournal of Chemical Information and Computer Sciences, 1992