ABSTRACT
For k ≥ 1 an integer, a set S of vertices of a graph G = (V, E) is a k-dominating set of G if every vertex of V − S is within distance k from some vertex of S In this chapter, we survey some recent results concerning this distance version of domination in graphs.
