8 citations · 20 across the 17 of their papers we have counts for
5 papers · 1 filter
Eternal Domination in Trees
William F. Klostermeyer, Gary MacGillivray
Mobile guards on the vertices of a graph are used to defend the graph against an infinite sequence of attacks on vertices. A guard must move from a neighboring vertex to an attacke…
Switching -mixed graphs with respect to Abelian groups
E. Leclerc, G. MacGillivray, J. M. Warren
We extend results of Brewster and Graves for switching -edge coloured graphs with respect to a cyclic group to switching -mixed graphs with respect to an Abelian group.…
Eternal Domination and Clique Covering
Gary MacGillivray, C. M. Mynhardt, Virgélot Virgile
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 a…
Proving exact values for the -limited broadcast domination number on grid graphs
Aaron Slobodin, Gary MacGillivray, Wendy Myrvold
We establish exact values for the -limited broadcast domination number of various grid graphs, in particular for and all , $P_m \squa…
2-limited broadcast domination on grid graphs
Aaron Slobodin, Gary MacGillivray, Wendy Myrvold
We establish upper and lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular the Cartesian product of two paths, a path and a cycle, and…