The connective eccentricity index (CEI) of a graph G is defined as, where ε G (.) denotes the
eccentricity of the corresponding vertex. The CEI obligates an influential ability, which is due …

The eccentric distance sum is a novel graph invariant with vast potential in structure
activity/property relationships. This graph invariant displays high discriminating power with …

Given a connected graph G=(VG, EG), the eccentricity distance sum (EDS) of G is defined as
ξ d (G)=∑{u, v}⊆ VG (ε (u)+ ε (v)) d G (u, v) and the eccentric connectivity index (ECI) of G is …

The eccentric distance sum (EDS) and degree distance (DD) are two distance-based graph
invariants which have been well-studied in recent years. The study on relationships between …

The eccentric distance sum (EDS) of a connected graph G is defined as ξ d (G)=∑ v∈ VG (ε
G (u)+ ε G (v)) d G (u, v), where ε G (⋅) is the eccentricity of the corresponding vertex and d G …

The total reciprocal edge-eccentricity is a novel graph invariant with vast potential in
structure activity/property relationships. This graph invariant displays high discriminating …

The connective eccentricity index is a novel graph invariant with vast potential in structure
activity/property relationships. This graph invariant displays high discriminating power with …

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 …

Given a connected graph G, the eccentric resistance-distance sum of G is defined as ξ R
(G)=∑{u, v}⊆ VG (ε G (u)+ ε G (v)) R uv, where ε G (⋅) is the eccentricity of the …

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 …