A path P is a segment of a tree if the endpoints of P are of degree 1 or at least 3, and each of
the rest vertices are of degree 2 in the tree. The lengths of all the segments of this tree form …

Some sharp bounds on the general eccentric distance sum are presented for (i) graphs with
given order and chromatic number,(ii) trees with given bipartition, and (iii) bipartite graphs …

The eccentric connectivity index of a graph G is ξ^ c (G)= ∑ _ v ∈ V (G) ε (v)\deg (v) ξ c
(G)=∑ v∈ V (G) ε (v) deg (v), and the eccentric distance sum is ξ^ d (G)= ∑ _ v ∈ V (G) ε (v) …

For a, b∈ ℝ, we define the general eccentric distance sum of a connected graph G as EDS
a, b (G)=∑ v∈ V (G)(ecc G (v)) a (DG (v)) b, where V (G) is the vertex set of G, ecc G (v) is …

This paper is concerned with the general eccentric distance sum index and the general
degree eccentricity index of graphs. Bounds on the difference between these indices are …

We obtain some sharp bounds on the general eccentric distance sum for general graphs,
bipartite graphs and trees with given order and diameter 3, graphs with given order and …

For a, b∈ ℝ, the general eccentric distance sum of a connected graph G is defined as EDS
a, b (G)=∑ u∈ V (G)[ecc G (u)] a [DG (u)] b, where V (G) is the vertex set of G, ecc G (u) is …