Algorithmic Aspects of Secure Connected Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy

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