The eccentric-distance sum of some graphs
| Main Authors: | P, Padmapriya; Department of Studies in Mathematics University of Mysore, Manasagangotri Mysuru - 570 006, India, Mathad, Veena; Department of Studies in Mathematics University of Mysore, Manasagangotri Mysuru - 570 006, India |
|---|---|
| Other Authors: | UGC-BSR |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2017
|
| Subjects: | |
| Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/294 http://www.ejgta.org/index.php/ejgta/article/view/294/pdf_36 |
Daftar Isi:
- Let $G = (V,E)$ be a simple connected graph. Theeccentric-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)$ %\dsis the eccentricity of the vertex $u$ in $G$ and $d(u,v)$ is thedistance between $u$ and $v$. In this paper, we establish formulaeto calculate the eccentric-distance sum for some graphs, namelywheel, star, broom, lollipop, double star, friendship, multi-stargraph and the join of $P_{n-2}$ and $P_2$.