| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902758 | AKCE International Journal of Graphs and Combinatorics | 2017 | 8 Pages |
Abstract
For any (finite simple) graph G the secure domination number of G satisfies γs(G)â¥|V(G)|2. Here we find a secure-dominating set S in G such that |S|=â|V(G)|2â in all cases when G is a grid, and in the majority of cases when G is a cylindrical or toroidal grid. In all such cases, S satisfies the additional requirement that G[S] is connected. We make note that the concept of secure-dominating sets considered in this paper is quite different from the other secure domination currently of interest.1
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Johnathan Barnett, Adam Blumenthal, Peter Johnson, Cadavious Jones, Ryan Matzke, Egbert Mujuni,