Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee

Abstract

Jha, Pradhan, and Banerjee devised a linear algorithm to compute the secure domination number of a cograph. Here it is shown that their Lemma~2, which is crucial for the computational complexity of the algorithm, is incomplete. An accordingly modified lemma is proved and it is demonstrated that the complexity of the modified algorithm remains linear.