• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology

Article

Indian Journal of Science and Technology

Year: 2015, Volume: 8, Issue: 2, Pages: 152–156

Original Article

Average D-distance Between Edges of a Graph

Abstract

The D-distance between vertices of a graph G is obtained by considering the path lengths and as well as the degrees of vertices present on the path. The average D-distance of a connected graph is the average of the D-distance between all pairs of vertices of the graph. Similarly, the average edge D-distance is the average of D-distances between all pairs of edges in the graph. In this article we study the average edge D-distance of a graph. We find bounds for average edge D-distance which are sharp and also prove some other results.

Keywords:
Average D-distance, D-distance, Diameter, 2000 Mathematics subject classifications: 05C12

DON'T MISS OUT!

Subscribe now for latest articles and news.