Gary MacGillivray

most citedSwitching

m

-edge-coloured graphs using non-Abelian groups

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2022★ 1 cited

Switching $m$ -edge-coloured graphs using non-Abelian groups

Chris Duffy, Gary MacGillivray, Ben Tremblay

Let $G$ be a graph whose edges are each assigned one of the $m$ -colours $1, 2, \dots, m$ , and let $Γ$ be a subgroup of $S_{m}$ . The operation of switching at a vertex $x$ with respe…

math.CO2022

Complexity of injective homomorphisms to small tournaments, and of injective oriented colourings

Russell J. Campbell, Nancy E. Clarke, Gary MacGillivray

Several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ are considered. In each case, we determine the complexity of…

math.CO2021

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 m-edge-coloured graphs using non-Abelian groups

Complexity of injective homomorphisms to small tournaments, and of injective oriented colourings

Eternal Domination in Trees

Switching $m$ -edge-coloured graphs using non-Abelian groups