On restrained edge dominating set of graphs
Samir K. VAIDYA, P. D. Ajani · Malaya Journal of Matematik · 2020
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 $\gamma_{r e}(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.