research
∙
02/12/2020
Algorithmic Complexity of Isolate Secure Domination in Graphs
A dominating set S is an Isolate Dominating Set (IDS) if the induced sub...
share
research
∙
02/03/2020
Algorithmic Complexity of Secure Connected Domination in Graphs
Let G = (V,E) be a simple, undirected and connected graph. A connected (...
research
∙
01/31/2020
Algorithmic Aspects of Some Variants of Domination in Graphs
A set S ⊆ V is a dominating set in G if for every u ∈ V ∖ S, there exist...
research
∙
01/30/2020
