The Wiener index of a connected graph is the summation of distances between all
unordered pairs of vertices of the graph. The status of a vertex in a connected graph is the …

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 …

Let G be aa connected graph. The Wiener index of a connected graph is the sum of the
distances between all unordered pairs of vertices. We provide asymptotic formulae for the …

The average distance µ (G) of a connected graph G of order n is the average of the
distances between all pairs of vertices of G, ie, equation image, where V (G) denotes the …

Abstract Let G=(V, E) be a connected graph on n vertices. Denote byl (G) the average
distance between all pairs of vertices in G. The remoteness ρ (G) of a connected graph G is …

The Wiener index of a graph G, denoted W (G), is the sum of the distances between all non-
ordered pairs of vertices in GÉ Czabarka, et al. conjectured that for a simple …

The D-distance between vertices of a graph G is obtained by considering the path lengths
and as well as the degrees of vertices present on the path. The average D-distance between …

Let G be a connected graph. The Steiner distance d (S) of a set S of vertices is the minimum
size of a connected subgraph of G containing all vertices of S. For k∈ N, the Steiner k …

The D-distance between vertices of a graph G is obtained by considering the path lengths
and as well as the degrees of vertices present on the path. The average D-distance of a …

The eccentricity of a vertex $ u $ in a connected graph $ G $ is the distance between $ u $
and a vertex farthest from it; the eccentric sequence of $ G $ is the nondecreasing sequence …