×

zbMATH — the first resource for mathematics

Independent domination in graphs: A survey and recent results. (English) Zbl 1260.05113
Summary: A set \(S\) of vertices in a graph \(G\) is an independent dominating set of \(G\) if \(S\) is an independent set and every vertex not in \(S\) is adjacent to a vertex in \(S\). In this paper, we offer a survey of selected recent results on independent domination in graphs.

MSC:
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
PDF BibTeX XML Cite
Full Text: DOI