Let G=(V,E) be a graph with no isolated vertices. A vertex v totally
dom...
For a simple graph G=(V,E) without any isolated vertex, a cosecure
domin...
For a graph G=(V,E), a subset D of vertex set V, is a dominating set of
...
For a given graph G, a maximum internal spanning tree of G is a spanning...
In a graph G=(V,E) with no isolated vertex, a dominating set D ⊆
V, is c...
A dominating set D of a graph G without isolated vertices is called
semi...
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...