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

Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive algorithmic proofs of a variety of combinatorial lenmas in topology. \Je demonstrate two new dual lemmas on the n-dimensional cube, and use a Generc.lized S ^erner Lemma to prove a gener lization of the Knaster-Kuratowski-y.azurkiewicz Covering Lemma on the simplex. We also s...

In this paper I reflect on the odds and ends of research – that is to say, fragments notes, miscellanea drafts, offcuts applications, keepsakes fieldwork; in short, archival remains unfinished research. Through a discussion failure, loss, incomplete, abandoned, poses questions about threshold endings. At what point does something fall by wayside, never be returned to? More pragmatically, might ...