Let G = (V, E) be a connected graph.  Let  be any connected graph.  Let .  The set is said to be an exact edge dominating set , if  and  for every  and .  An exact edge dominating set is denoted as ExED set.  The exact edge domination number  of a graph equals the cardinality of a minimum exact edge dominating set.In this paper, the features of exact edge dominating sets in the given graphs are derived.  Also the bounds of size and diameter of the graphs are defined in terms of maximum degree ∆(G).  We prove that in a connected graph G with .  Then

Index Terms- Exact dominating set, exact edge dominating set, wounded spider, corona graph