Journal
DISCRETE MATHEMATICS
Volume 313, Issue 7, Pages 839-854Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disc.2012.11.031
Keywords
Independent dominating
Categories
Ask authors/readers for more resources
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. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
