The Wiener index (ie, the total distance or the transmission number), defined as the sum of
distances between all unordered pairs of vertices in a graph, is one of the most popular …

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex
represents an atom of molecule and edges between the corresponding vertices are used to …

Let G be a connected graph of order n. The long-standing open and close problems in
distance graph theory are: what is the Wiener index W (G) or average distance μ (G) μ (G) …

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 …

The Wiener index is defined as the sum of distances between all unordered pairs of vertices
in a graph. It is one of the most recognized and well-researched topological indices, which is …

The Wiener index of a graph is one of the most recognised and very well-researched
topological indices, ie graph theoretic invariants of molecular graphs. Nonetheless, some …

A segment of a tree is a path whose ends are branching vertices (vertices of degree greater
than 2) or leaves, while all other vertices have degree 2. The lengths of all the segments of a …

The (ordinary) Wiener index of a connected graph is defined to be the sum of distances
between all vertex pairs in this graph. For a connected graph, its peripheral Wiener index is …

The well-known Wiener index is defined as the sum of pairwise distances between vertices.
Extremal problems with respect to it have been extensively studied for trees. A …

The Wiener index of a connected graph is the sum of the distances between all pairs of
vertices in the graph. It was conjectured that the Wiener index of an n-vertex maximal planar …