2024match Communications in Mathematical and in Computer ChemistryOpen access

A Survey of Recent Extremal Results on the Wiener Index of Trees

Hong Lin

Open full text 1 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Survey of Recent Extremal Results on the Wiener Index of Trees — Research Paper | ScholarLens