• k.john bosco
• Sathija J Prathisa SK

For two vertices u and v of a graph G, the usual distance d (u, v), is the length of the shortest path between u and v. In this paper we introduced the concept of DdpM- distance by considering the degrees of various vertices presented in the path, in addition to the length of the path. We study some properties with this new distance. We define the eccentricities of vertices, radius and diameter of G with respect to the DdpM-distance. First we prove that the new distance is a metric on the set of vertices of G. We compare the usual, longest and DdpM- distances of two vertices u, v of V.

Longest distance, DdpM- distance, DdpM- Eccentricity, DdpM- Radius and DdpM- Diameter.

"D^dpM-DISTANCE IN GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 7, page no.g351-g355, July-2023, Available :http://www.jetir.org/papers/JETIR2307653.pdf

"D^dpM-DISTANCE IN GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.10, Issue 7, page no. ppg351-g355, July-2023, Available at : http://www.jetir.org/papers/JETIR2307653.pdf