An algorithm to find a dominating set that secures any connected graph G

A social network or any computer network is vulnerable to an attack on any one of its nodes. For the network to function efficiently and without delays, we need to protect the node under attack and ensure that the node functions even after the attack has occurred. A set of nodes is a secure dominating set if it can monitor every other node of the network and which can take over the functionality of a failing node in an emergency. We propose an algorithm to find the secure dominating set in any connected network or graph. As a case study, we examine a network of CCTV cameras.