Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
13430835 | Discrete Applied Mathematics | 2019 | 6 Pages |
Abstract
A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G
and, for each vertex uââS, there is a vertex vâS such that uv is an edge and (Sâ{v})âª{u} is also a dominating set of G. The secure domination number γs(G) is the cardinality of a smallest secure dominating set of G. In this paper, we propose a linear-time algorithm for finding the secure domination number of cographs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Toru Araki, Ryo Yamanaka,