Add to ORKGA 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
A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A subset D of vertices in a graph G is an independent dominating set if D is a dominating set and an...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
AbstractA subset D of the vertex set of a graph G is irredundant if every vertex v in D has a privat...
The paper continues the study of independent set dominating sets in graphs which was started by E. S...
AbstractAn independent dominating set of a graph G=(V,E) is a pairwise non-adjacent subset D of V su...
A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A subset D of vertices in a graph G is an independent dominating set if D is a dominating set and an...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
We initiate the study of double outer-independent domination in graphs. A vertex of a graph is said ...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
AbstractA subset D of the vertex set of a graph G is irredundant if every vertex v in D has a privat...
The paper continues the study of independent set dominating sets in graphs which was started by E. S...
AbstractAn independent dominating set of a graph G=(V,E) is a pairwise non-adjacent subset D of V su...
A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A...
AbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adja...
A subset D of vertices in a graph G is an independent dominating set if D is a dominating set and an...