On the complexity of Dominating Set for graphs with fixed diameter

Valentin Bouquet, François Delbot, Christophe Picouleau +1

A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ a…