1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
The complexity of frugal digraph homomorphisms
Stefan Bard, Gary MacGillivray, Jacobus Swarts
For an integer , a homomorphism of a digraph G to a digraph is -frugal if no more than in-neighbours of any vertex of have the same image. There is a dicho…
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 such that (the eccentricity of ) for all…
A dichotomy theorem for -switchable -colouring on -edge coloured graphs
Richard Brewster, Arnott Kidner, Gary MacGillivray
Let be a graph in which each edge is assigned one of the colours , and let be a subgroup of . The operation of switching at a vertex of with r…
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…
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.…