A set S of vertices in a graph G is a dominating set if every vertex of
...
Let G be graph with vertex set V and order n=|V|. A coalition in G is
a ...
Let G=(V,E) be a graph with no isolated vertices. A vertex v totally
dom...
We study upper bounds on the size of optimum locating-total dominating s...
A dominating set D of a graph G without isolated vertices is called
semi...
A set S of vertices in a graph G is a dominating set if every vertex not...
For a graph G=(V,E) with no isolated vertices, a set D⊆ V is
called a se...
For a graph G=(V,E), a set D ⊆ V is called a semitotal dominating
set of...