2 citations · 2 across the 10 of their papers we have counts for
11 papers
Existence of Optimally-Greatest Digraphs for Strongly Connected Node Reliability
Danielle Cox, Kyle MacKeigan, Emily Wright
In this paper, we introduce a new model to study network reliability with node failures. This model, strongly connected node reliability, is the directed variant of node reliabilit…
Eternal distance-k domination on graphs
Danielle Cox, Erin Meger, M. E. Messinger
Eternal domination is a dynamic process by which a graph is protected from an infinite sequence of vertex intrusions. In eternal distance- domination, guards initially occupy th…
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…
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…
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…
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…