A note on eccentric distance sum
نویسندگان
1 Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785 – 136, I R. Iran
doi
10.22061/jmns.2012.470چکیده
The eccentric distance sum is a graph invariant defined as $\sum_{uv\in E} εG(v)DG(v)$, where εG(v) is the eccentricity of a vertex v in G and DG(v ) is the sum of distances of all vertices in G from v. In this paper, we compute the eccentric distance sum of Volkmann tree and then we obtain some results for vertex−transitive graphs
