Danielle Cox

According to our database, Danielle Cox authored at least 16 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Diffusion: quiescence and perturbation.

Todd Mullen, Richard J. Nowakowski, Danielle Cox

Australas. J Comb., October, 2024

2023

Existence of optimally-greatest digraphs for strongly connected node reliability.

Kyle MacKeigan, Danielle Cox, Emily Wright

Networks, September, 2023

Chromatic Polynomials of 2-Edge-Coloured Graphs.

Iain Beaton, Danielle Cox, Christopher Duffy, Nicole Zolkavich

Electron. J. Comb., 2023

2021

Network reliability: Heading out on the highway.

Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol

Networks, 2021

Eternal k-domination on graphs.

Danielle Cox, Erin Meger, Margaret-Ellen Messinger

CoRR, 2021

2020

Optimal Domination Polynomials.

Iain Beaton, Jason I. Brown, Danielle Cox

Graphs Comb., 2020

Limited visibility Cops and Robber.

Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger

Discret. Appl. Math., 2020

2019

Hyperopic Cops and Robbers.

Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger

Theor. Comput. Sci., 2019

Chromatic Polynomials of Oriented Graphs.

Danielle Cox, Christopher Duffy

Electron. J. Comb., 2019

The damage number of a graph.

Danielle Cox, Asiyeh Sanaei

Australas. J Comb., 2019

2018

Optimal Graphs for Independence and <i>k</i>-Independence Polynomials.

Jason I. Brown, Danielle Cox

Graphs Comb., 2018

2017

Limited Visibility Cops and Robbers.

Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger

CoRR, 2017

2016

Inflection points of reliability polynomials are dense in [0, 1].

Jason I. Brown, Danielle Cox

Networks, 2016

2014

Nonexistence of optimal graphs for all terminal reliability.

Jason I. Brown, Danielle Cox

Networks, 2014

The average reliability of a graph.

Jason I. Brown, Danielle Cox, Richard Ehrenborg

Discret. Appl. Math., 2014

2009

The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.

Jason I. Brown, Danielle Cox

Discret. Math., 2009