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/29/2010