Super dominating sets in graphs

M. Lemańska, V. Swaminathan, Y. B. Venkatakrishnan +1

Let $G=(V,E)$ be a graph. A subset $D$ of $V(G)$ is called a super dominating set if for every $v\in V(G)-D$ there exists an external private neighbour of $v$ with respect to $V(G…