Lower Bounds on the Distance Domination Number of a Graph

Randy Davila, Caleb Fast, Michael Henning +1

For an integer $k\ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G)\setminus S$ is at distance at mo…