ddM-DISTANCE IN SNAKE 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 study the concept of ddM- distance in snake related graph. We study some properties of snake related graph with this new distance. We define the eccentricities of vertices, radius and diameter of snake related graph with respect to the ddM-distance. We compare the usual, geodesic and ddM-distances of two vertices u,v of V.