Independent domination in graphs: A survey and recent results

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.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 313; no. 7; pp. 839 - 854
Main Authors Goddard, Wayne, Henning, Michael A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.04.2013
Subjects
Independent dominating
Independent dominating
Online AccessGet full text

Cover

More Information
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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2012.11.031