… The secure domination number γ s ( G ) is the cardinality of a smallest secure dominating set
… , we propose a linear-time algorithm for finding the secure domination number of cographs. …

… By using the structure of chain graphs and cographs, we propose linear time algorithms
for computing the secure total domination number of a given chain graph and cograph. …

… Recently in [23], Kusum and Pandey augmented the complexity results and proved that
the co-secure domination number of cographs can be determined in linear-time. They also …

… the cosecure domination number of cographs. In … Domination problem is the secure
domination which is defined as follows. A dominating set \(S \subseteq V\) of G is called a secure …

… problem is efficiently solvable for proper interval graphs and cographs. … a dominating set
of G. The minimum cardinality of a secure dominating set of G is called the secure domination …

… that the Co-secure Domination problem is efficiently solvable for proper interval graphs and
cographs. In an effort to reduce the complexity gap of the Co-secure Domination problem, in …

… cardinality of the global secure sets in the class of cographs. … That is why we will give
examples of such cographs. Let P′ … Then we can find a set D such that D is secure, dominating, …

… problem is efficiently solvable for proper interval graphs and cographs. In this paper, … secure
domination and that cosecure domination is, in a way, a complement to secure domination…

… The secure domination number of G, denoted by γ s ( G ) , is the minimum cardinality of a
secure dominating … the secure domination number of a cograph having n vertices and m edges. …

… of a co-secure dominating set in G is the co-secure domination number of G . In … for finding
the co-secure domination number of proper interval graphs. … Secure domination in cographs …