Algorithmic Complexity of Secure Connected Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

Let $G=(V,E)$ be a simple, undirected and connected graph. A connected (total) dominating set $S\subseteq V$ is a secure connected (total) dominating set of $G$, if for each $ u…