Restrained domination in graphs with minimum degree two (Q2708253)

A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex \(x\in V(G)- S\) is adjacent to a vertex of \(S\). If, moreover, each vertex \(x\in V(G)- S\) is adjacent to a vertex of \(V(G)- S\), then \(S\) is called restrained dominating in \(G\). The minimum number of vertices of a dominating (or restrained dominating) set in \(G\) is the domination number \(\gamma(G)\) of \(G\) (or the restrained domination number \(\gamma_r(G)\) of \(G\), respectively). Upper bounds for \(\gamma_r(G)\) are found, related to \(\gamma(G)\) and to degrees of vertices of \(G\).