Let G = (V(G), E(G)) be a simple connected graph. A subset M of E(G) is a restrained edge dominating set of G if every edge not in M is adjacent to some edge in M and to another edge not in M. The restrained edge domination number of G, denoted by γ_re(G), is the minimum cardinality of a restrained edge dominating set of G. Moreover, any restrained edge dominating set of G with cardinality γ_re(G) is referred to as a γ_re-set of G. In this study, the researcher investigates the concept of restrained edge domination in a graph and obtains some results involving the concepts of edge domination and restrained edge domination.

domination, edge domination, restrained edge domination.