The eccentricity of a node v in a network is the maximum distance from v to any other node.
In social networks, the reciprocal of eccentricity is used as a measure of the importance of a …

The eccentricity of a vertex, ecc T (v)= max u∈ T d T (v, u), was one of the first, distance-
based, tree invariants studied. The total eccentricity of a tree, Ecc (T), is the sum of the …

The relation between the Wiener index W (G) and the eccentricity ε (G) ε (G) of a graph G is
studied. Lower and upper bounds on W (G) in terms of ε (G) ε (G) are proved and extremal …

Let G be a connected graph. The eccentricity e (v) of a vertex v is the distance from v to a
vertex farthest from v. The average eccentricity avec (G) of G is defined as the average of the …

Let G be a finite, connected graph. The eccentricity of a vertex v of G is the distance from v to
a vertex farthest from v. The average eccentricity of G is the arithmetic mean of the …

The average eccentricity ecc (G) of a graph G is the mean value of eccentricities of all
vertices of G. In this paper, we continue the work of Ilić (2012) and resolve a conjecture …

Let G be a connected finite graph with vertex set V (G). The eccentricity e (v) of a vertex v is
the distance from v to a vertex farthest from v. The average eccentricity of G is defined as 1| V …

A graph is a block graph if its blocks are all cliques. In this paper, we study the average
eccentricity of block graphs from the perspective of block order sequences. An equivalence …

We study the Steiner k-eccentricity on trees, which generalizes the previous one in the paper
[On the average Steiner 3-eccentricity of trees, arxiv: 2005.10319]. We achieve much …

The average eccentricity of an n-vertex connected graph G=(VG, EG) is defined as ε ̄ (G)=
1 n∑ x∈ VG ε G (x), where ε G (x) is the eccentricity of the vertex x in G. Our main results in …