Article ID Journal Published Year Pages File Type
4647824 Discrete Mathematics 2013 16 Pages PDF
Abstract

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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Independent domination in graphs: A survey and recent results
Authors
, ,