D^DM- DISTANCE IN CYCLE RELATED GRAPHS

Abstract

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 DdM- 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 DdM- distance. First we prove that the new distance is a metric on the set of vertices of G. We compare the usual, detour and DdM-distances of two vertices u,v of V.