Maximizing Wiener index for trees with given vertex weight and degree sequences

Mikhail Goubko

Applied Mathematics and Computation, 2018, vol. 316, issue C, 102-114

Abstract: The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional “unweighed” Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that there exists an optimal caterpillar. If weights of internal vertices increase in their degrees, then an optimal caterpillar exists with weights of internal vertices on its backbone monotonously increasing from some central point to the ends of the backbone, and the same is true for pendent vertices. A tight upper bound of the Wiener index value is proposed and an efficient greedy heuristics is developed that approximates well the optimal index value. Finally, a branch and bound algorithm is built and tested for the exact solution of this NP-complete problem.

Keywords: Wiener index for graph with weighted vertices; Upper-bound estimate; Greedy algorithm; Optimal caterpillar (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317305386
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:316:y:2018:i:c:p:102-114

DOI: 10.1016/j.amc.2017.07.077

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().