The following pages link to Danielle Cox (Q2227987):
Displaying 19 items.
- (Q406317) (redirect page) (← links)
- The average reliability of a graph (Q406318) (← links)
- The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane (Q1044980) (← links)
- Optimal graphs for independence and \(k\)-independence polynomials (Q1756111) (← links)
- Optimal domination polynomials (Q2227988) (← links)
- Chromatic polynomials of oriented graphs (Q2325756) (← links)
- (Q3295614) (← links)
- (Q4555768) (← links)
- Nonexistence of optimal graphs for all terminal reliability (Q4639690) (← links)
- Inflection points of reliability polynomials are dense in [0,1] (Q4642412) (← links)
- (Q5088675) (← links)
- (Q5206905) (← links)
- Network reliability: Heading out on the highway (Q6087070) (← links)
- Eternal distance-\(k\) domination on graphs (Q6108933) (← links)
- Existence of optimally‐greatest digraphs for strongly connected node reliability (Q6139368) (← links)
- Diffusion: quiescence and perturbation (Q6644883) (← links)
- Time-delayed cops and robbers (Q6648280) (← links)
- The rhizomic tiles at Shooter’s Hill: an application of Truchet tiles (Q6671256) (← links)
- Graph Burning On Large $p$-Caterpillars (Q6758550) (← links)
