EDGE DISTANCE BALANCED PROPERTIES IN OPERATION OF GRAPHS

Let G be a graphand e = uv be an edge of G, if number of edges lying closer to the vertex u than the vertex v, be equals to number of edges lying closer to the vertex v than the vertex u, Then G is called edge-distance-balanced (EDB). A connected graph G is called n-edge-distance-balanced (n-EDB) if for each a, b ∈ V (G) with d(a, b) = n we have above property. In this paper, we derive some results relevant for n-EDB graphs to the certain graph operations if n = 1, 2 .