A Survey of Recent Extremal Results on the Wiener Index of Trees
Hong Lin
Abstract
Open-access reader
Hong Lin
Abstract
Open-access reader
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. In this paper, we survey the known extremal results about the Wiener index of trees and the roots of the Wiener polynomials of trees from 2014 together with some open problems.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. In this paper, we survey the known extremal results about the Wiener index of trees and the roots of the Wiener polynomials of trees from 2014 together with some open problems.
Key concepts: Wiener index, Mathematics, Index (typography), Combinatorics, Graph, Connectivity, Topological index, Tree (set theory)