For any graph G = (V,E) a subset D ⊆ V is a dominating set if every vertex in V −D is adjacent to at least one vertex in D. A dominating set is said to be a complementary tree dominating set if the induced subgraph is a tree. The minimum cardinality of a complementary tree dominating set is called the complementary tree domination number
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex ...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
Let F be a minimum edge dominating set of G. If E - F contains an edge dominating set say F′, then F...
Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is s...
Copyright © 2013 G. Mahadevan et al. This is an open access article distributed under the Creative C...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a ...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex ...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
Let F be a minimum edge dominating set of G. If E - F contains an edge dominating set say F′, then F...
Let be a simple, finite and undirected graph and without isolated vertex. A subset D of V is s...
Copyright © 2013 G. Mahadevan et al. This is an open access article distributed under the Creative C...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a ...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
AbstractA subset S of V is called a total dominating set if every vertex in V is adjacent to some ve...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \textbackslashD is...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Abstract. A total dominating set of a graph G is a set D of vertices of G such that every vertex of ...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
DOI
Add to ORKG