The eccentric-distance sum of some graphs

Padmapriya P, Veena Mathad


Let $G = (V,E)$ be a simple connected graph. The
eccentric-distance sum of $G$ is defined as
$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where $e(u)$ %\ds
is the eccentricity of the vertex $u$ in $G$ and $d(u,v)$ is the
distance between $u$ and $v$. In this paper, we establish formulae
to calculate the eccentric-distance sum for some graphs, namely
wheel, star, broom, lollipop, double star, friendship, multi-star
graph and the join of $P_{n-2}$ and $P_2$.


eccentricity, star, path, broom, lollipop, double star, complete k-partite

Full Text:




  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats