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.
机构:
Clemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA
Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South AfricaClemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA
Goddard, Wayne
Henning, Michael A.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South AfricaClemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA