On the Wiener Indices of Trees Ordering by Diameter-Growing Transformation Relative to the Pendent Edges

Xiaoxin Xu, Yubin Gao, Yanbin Sang and Yueliang Liang

Mathematical Problems in Engineering, 2019, vol. 2019, 1-11

Abstract:

The Wiener index of a graph is defined as the sum of distances between all unordered pairs of its vertices. We found that finite steps of diameter-growing transformation relative to vertices can not always enable the Wiener index of a tree to increase sharply. In this paper, we provide a graph transformation named diameter-growing transformation relative to pendent edges, which increases Wiener index of a tree sharply after finite steps. Then, twenty-two trees are ordered by their Wiener indices, and these trees are proved to be the first twenty-two trees with the first up to sixteenth smallest Wiener indices.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/8769428.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/8769428.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8769428

DOI: 10.1155/2019/8769428

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().