Danielle Cox

19 papers Journal 19
YearRankTypeTitle / Venue / Authors
2025 J jnl
Burning sufficiently large $p$-caterpillars for a fixed $p$.
Australas. J Comb.
Danielle Cox, Margaret-Ellen Messinger, Kerry Ojakian
2024 J jnl
Diffusion: quiescence and perturbation.
Australas. J Comb.
Todd Mullen, Richard J. Nowakowski, Danielle Cox
2023 J jnl
Chromatic Polynomials of 2-Edge-Coloured Graphs.
Electron. J. Comb.
Iain Beaton, Danielle Cox, Christopher Duffy, Nicole Zolkavich
2023 J jnl
Existence of optimally-greatest digraphs for strongly connected node reliability.
Networks
Kyle MacKeigan, Danielle Cox, Emily Wright
2021 J jnl
Eternal k-domination on graphs.
CoRR
Danielle Cox, Erin Meger, Margaret-Ellen Messinger
2021 J jnl
Network reliability: Heading out on the highway.
Networks
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
2020 J jnl
Limited visibility Cops and Robber.
Discret. Appl. Math.
Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger
2020 J jnl
Optimal Domination Polynomials.
Graphs Comb.
Iain Beaton, Jason I. Brown, Danielle Cox
2019 J jnl
Chromatic Polynomials of Oriented Graphs.
Electron. J. Comb.
Danielle Cox, Christopher Duffy
2019 J jnl
Hyperopic Cops and Robbers.
Theor. Comput. Sci.
Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger
2019 J jnl
The damage number of a graph.
Australas. J Comb.
Danielle Cox, Asiyeh Sanaei
2018 J jnl
Chromatic Polynomials of Oriented Graphs.
CoRR
Danielle Cox, Christopher Duffy
2018 J jnl
Optimal Graphs for Independence and
Graphs Comb.
Jason I. Brown, Danielle Cox
2017 J jnl
Hyperopic Cops and Robbers.
CoRR
Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger
2017 J jnl
Limited Visibility Cops and Robbers.
CoRR
Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger
2016 J jnl
Inflection points of reliability polynomials are dense in [0, 1].
Networks
Jason I. Brown, Danielle Cox
2014 J jnl
Nonexistence of optimal graphs for all terminal reliability.
Networks
Jason I. Brown, Danielle Cox
2014 J jnl
The average reliability of a graph.
Discret. Appl. Math.
Jason I. Brown, Danielle Cox, Richard Ehrenborg
2009 J jnl
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.
Discret. Math.
Jason I. Brown, Danielle Cox