Independent domination in graphs: A survey and recent results

A set SS of vertices in a graph GG is an independent dominating set of GG if SS is an independent set and every vertex not in SS is adjacent to a vertex in SS. In this paper, we offer a survey of selected recent results on independent domination in graphs.