Convex and isometric domination of (weak) dominating pair graphs

Boštjan Brešar, Tanja Gologranc, Tim Kos

A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, i…