Let G = (V, E) be a simple graph. Let u and v be two vertices of a connected graph G. Then the d-length of a u-v path defined as d d (u, v) = d(u, v) + deg(u) + deg(v) + deg(u) deg(v), where d(u, v) is the shortest distance between the vertices u and v. In this paper d d – distance of edge removal in some special graphs are determined.