A note on eccentric distance sum

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

کلیدواژه ها:

Eccentricity ، eccentric distance sum ، Volkmann tree