activity
20172020
most citedLimited Visibility Cops and Robbers

2 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing math.COShow all

7 papers · 1 filter

math.CO2020

Complete Graphs and Polyominoes

Todd Mullen, Richard Nowakowski, Danielle Cox

In the chip-firing variant, Diffusion, chips flow from places of high concentration to places of low concentration (or equivalently, from the rich to the poor). We explore this mod…

math.CO2020

Counting Path Configurations in Parallel Diffusion

Todd Mullen, Richard Nowakowski, Danielle Cox

Parallel Diffusion is a variant of Chip-Firing introduced in 2018 by Duffy et al. In Parallel Diffusion, chips move from places of high concentration to places of low concentration…

math.CO2020

Chromatic polynomials of 2-edge coloured graphs

I. Beaton, D. Cox, C. Duffy +1

Using the definition of colouring of -edge-coloured graphs derived from -edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to -edge-colour…

math.CO2020

Diffusion: Quiescence and Perturbation

Danielle Cox, Todd Mullen, Richard Nowakowski

Originally proposed by Duffy et al., Diffusion is a variant of chip-firing in which chips from flow from places of high concentration to places of low concentration. In the variant…

math.CO2019

Optimal Domination Polynomials

I. Beaton, J. I. Brown, D. Cox

Let be a graph on vertices and edges and the domination polynomial of . In this paper we completely characterize the values of and for which optimal…

math.CO2017

Hyperopic Cops and Robbers

A. Bonato, N. E. Clarke, D. Cox +3

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the…