Abstract:
For a graph G = (V, E), a subset D of E is restrained edge dominating set of G if every edge not in D is adjacent
to an edge in D as well as an edge in E − D. The restrained edge domination number of G, denoted by γre(G)
is the minimum cardinality of a restrained edge dominating set of G. Here, we characterize restrained edge
dominating set and also investigate restrained edge domination number of some wheel related graphs.
