Mobile Guards’ Strategies for Graph Surveillance and Protection
| dc.contributor.author | Virgile, Virgélot | |
| dc.contributor.supervisor | MacGillivray, Gary | |
| dc.contributor.supervisor | Mynhardt, C. M. | |
| dc.date.accessioned | 2024-03-22T18:37:56Z | |
| dc.date.available | 2024-03-22T18:37:56Z | |
| dc.date.issued | 2024 | |
| dc.degree.department | Department of Mathematics and Statistics | |
| dc.degree.level | Doctor of Philosophy PhD | |
| dc.description.abstract | In this dissertation, we study the “one guard moves” model of both the eternal domination game and the eviction game. We investigate the computational complexity of deciding whether k guards can respond to any sequence of attacks on an n-vertex graph G in both games. We show that this decision problem is EXPTIME-complete when neither G nor k is fixed, and when the initial configuration of the guards is given in both cases. We further show that in the case of the eternal domination game, if the guards can choose their initial configuration and the graph is directed, the decision problem remains EXPTIME-complete. We present an algorithm that decides the problem in time O(kn^(k+2)) for both games, marking a significant improvement over the previously fastest known algorithm which has time complexity O(n^(2k+2)). Our algorithm further determines the maximum number of attacks (potentially infinite) the guards can defend from each configuration. We study the relationship between the eternal domination number of a graph and its clique covering number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt, and disprove a conjecture of Klostermeyer and MacGillivray (The Fundamental Conjecture [Eternal Domination: Criticality and Reachability, Discuss. Math. Graph Theory 37 (2017), no. 1, 63–77]). We prove that the smallest graph having its eternal domination number less than its clique covering number has ten vertices. We also demonstrate that for any integer k>=2, there exist infinitely many graphs having domination number and eternal domination number equal to k containing dominating sets which are not eternal dominating sets. In addition, we show that there exists a function f such that for any integer k>=1, any graph with independence number k has eviction number at most f(k). We further show that the eviction number of cographs can be computed in polynomial time. Finally, we study the length of both games when played on an n-vertex graph on which are located k guards; that is, the maximum number of turns required before a winner can be decided. | |
| dc.description.scholarlevel | Graduate | |
| dc.identifier.bibliographicCitation | G. MacGillivray, C. M. Mynhardt and V. Virgile, Eternal domination and clique covering, Electron. J. Graph Theory Appl. (EJGTA) 10 (2022), no. 2, 603–624. | |
| dc.identifier.uri | https://hdl.handle.net/1828/16282 | |
| dc.language | English | eng |
| dc.language.iso | en | |
| dc.rights | Available to the World Wide Web | |
| dc.subject | Domination | |
| dc.subject | Eternal Domination | |
| dc.subject | Pursuit Game | |
| dc.subject | Eviction | |
| dc.subject | Graph Theory | |
| dc.subject | Graph Protection | |
| dc.subject | EXPTIME-complete | |
| dc.subject | Clique Covering | |
| dc.title | Mobile Guards’ Strategies for Graph Surveillance and Protection | |
| dc.type | Thesis |