G. MacGillivray

activity

20162026

most citedCharacterizations and algorithms for generalized Cops and Robbers games

8 citations · 20 across the 17 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Boundary and Hearing Independent Broadcasts in Graphs and Trees

Jules Hoepner, Gary MacGillivray, Kieka Mynhardt

A broadcast on a connected graph G with vertex set V(G) is a function $f : V (G) \to {0, 1, ..., diam (G)}$ such that $f (v) \leq e (v)$ (the eccentricity of $v$ ) for all…

math.CO2023

A dichotomy theorem for $Γ$ -switchable $H$ -colouring on $m$ -edge coloured graphs

Richard Brewster, Arnott Kidner, Gary MacGillivray

Let $G$ be a graph in which each edge is assigned one of the colours $1, 2, \dots, m$ , and let $Γ$ be a subgroup of $S_{m}$ . The operation of switching at a vertex $x$ of $G$ with r…

math.CO2023

Fractional eternal domination: securely distributing resources across a network

Fnu Devvrit, Aaron Krim-Yee, Nithish Kumar +4

This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows an…

Boundary and Hearing Independent Broadcasts in Graphs and Trees

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs

Fractional eternal domination: securely distributing resources across a network

A dichotomy theorem for $Γ$ -switchable $H$ -colouring on $m$ -edge coloured graphs