Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-23T12:42:09.929Z Has data issue: false hasContentIssue false
  • English
  • Français

WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST $6$

Part of: Graph theory

Published online by Cambridge University Press:  19 September 2013

SIMON MUKWEMBI  and
TOMÁŠ VETRÍK
SIMON MUKWEMBI
Affiliation:
School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban, South Africa email Mukwembi@ukzn.ac.za
TOMÁŠ VETRÍK*
Affiliation:
Department of Mathematics and Applied Mathematics, University of Pretoria, Pretoria, South Africa
*
✉tomas.vetrik@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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

Wiener indexdegree distanceGutman indextreediameter

MSC classification

Secondary: 05C12: Distance in graphs 05C05: Trees 05C07: Vertex degrees
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 89 , Issue 3 , June 2014 , pp. 379 - 396
Copyright
Copyright ©2013 Australian Mathematical Publishing Association Inc. 

References

Andova, V., Dimitrov, D., Fink, J. and Skrekovski, R., ‘Bounds on Gutman index’, MATCH Commun. Math. Comput. Chem. 67 (2012), 515–524.Google Scholar
Bucicovschi, O. and Cioabǎ, S. M., ‘The minimum degree distance of graphs of given order and size’, Discrete Appl. Math. 156 (2008), 3518–3521.CrossRefGoogle Scholar
Dankelmann, P., Gutman, I., Mukwembi, S. and Swart, H. C., ‘On the degree distance of a graph’, Discrete Appl. Math. 157 (2009), 2773–2777.CrossRefGoogle Scholar
Dankelmann, P., Gutman, I., Mukwembi, S. and Swart, H. C., ‘The edge-Wiener index of a graph’, Discrete Math. 309 (2009), 3452–3457.Google Scholar
DeLaViña, E. and Waller, B., ‘Spanning trees with many leaves and average distance’, Electron. J. Combin. 15 (2008), 1–16.CrossRefGoogle Scholar
Gutman, I., ‘Selected properties of the Schultz molecular topological index’, J. Chem. Inf. Comput. Sci. 34 (1994), 1087–1089.Google Scholar
Klein, D. J., Mihalić, Z., Plavšić, D. and Trimajstrić, N., ‘Molecular topological index, a relation with the Wiener index’, J. Chem. Inf. Comput. Sci. 32 (1992), 304–305.CrossRefGoogle Scholar
Morgan, M. J., Mukwembi, S. and Swart, H. C., ‘On the eccentric connectivity index of a graph’, Discrete Math. 311 (2011), 1229–1234.Google Scholar
Mukwembi, S., ‘On the upper bound of Gutman index of graphs’, MATCH Commun. Math. Comput. Chem. 68 (2012), 343–348.Google Scholar
Plesník, J., ‘Critical graph of given diameter’, Acta Math. Univ. Comenian. (N.S.) 30 (1975), 71–93.Google Scholar
Tomescu, I., ‘Some extremal properties of the degree distance of a graph’, Discrete Appl. Math. 98 (1999), 159–163.CrossRefGoogle Scholar
Zhou, T., Xu, J. and Liu, J., ‘On diameter and average distance of graphs’, OR Trans. 8 (2004), 1–6.Google Scholar