Reducing Dominating Sets in Graphs

Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania

A dominating set of a graph $G=(V,E)$ is a subset of vertices $S\subseteq V$ such that every vertex $v\in V\setminus S$ has at least one neighbor in set $S$. The corresponding opti…