Connected minimum secure-dominating sets in grids
For any (finite simple) graph the secure domination number of satisfies . Here we find a secure-dominating set in such that in all cases when is a grid, and in the majority of cases when is a cylindrical or toroidal grid. In all such cases, satisfies the additional requirement that is connected. We...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.03.003 |