Abstract
A dynamic domination problem in graphs is studied in which an innite sequence of attacks occurs at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex. Other guards are allowed to move at the same time, and before and after each attack, the vertices containing guards must form a dominating set. We are concerned with the minimum number of guards required to achieve this goal against any arbitrary sequence of attacks; this number is called the swap number. The swap number lies between the domination and independence numbers of the graph; bounds for some classes of graphs are examined in this paper.
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: Journal of Discrete Mathematical Sciences and Cryptography
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.
