Abstract Paper
Journal of
Computational Mathametica
| Title | : The Eccentric-Distance Sum of Cycles and Related Graphs |
|---|---|
| Author(s) | : 1 S. Sujitha and 2 E. Surya Armstrong |
| Article Information | : , 32-42 |
| Affiliation(s) | : 1,2 Department of Mathematics Holy Cross College(Autonomous) Nagercoil,Tamil Nadu,India. |
Abstract :
Let G = (V,E) be a simple connected graph. The eccentric-distance sum of G is defined as ξ ds (G) =P u∈V (G) e(u)D(u) where e(u) is the eccentricity of the vertex u in G and D(u) is the sum of distances between u and all other vertices of G. In this paper, we establish formulae to calculate the eccentric-distance sum for some cycle related graphs, namely C n , complement of C n , shadow of C n and the line graph of C n . Also, it is shown that, the eccentric-distance sum of C n is less than the eccentric-distance sum of shadow of C n for all n ≥ 3.
| Keywords | : distance, eccentricity, eccentric-distance sum |
|---|---|
| Document Type | : Research Paper |
| DOI | : The Eccentric-Distance Sum of Cycles and Related Graphs |
| Publication date | : June 22, 2019 |