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.11The other sort of secure domination: A dominating set S⊆V(G) is secure dominating (in G) if and only if for every v∈V(G)∖S there is some u∈S such that (S∖{u})∪{v} is dominating, in G.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
