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

DOI10.1016/j.disc.2009.03.012zbMath1198.05076OpenAlexW2058654435MaRDI QIDQ1044980

Jason I. Brown, Danielle Cox

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.012

zbMATH Keywords

rootsdigraphclosurestrongly connected reliability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

On the roots of all-terminal reliability polynomials ⋮ Network reliability: Heading out on the highway ⋮ Existence of optimally‐greatest digraphs for strongly connected node reliability

Cites Work

• Unnamed Item
• Unnamed Item
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• Reliability polynomials and their asymptotic limits for families of graphs
• Homogeneous multivariate polynomials with the half-plane property
• Random matrices and graphs
• On the roots of strongly connected reliability polynomials
• Uniformly optimal digraphs for strongly connected reliability
• Roots of the Reliability Polynomials
• Exact reliabilities of most reliable double-loop networks
• Survival reliability of some double-loop networks and chordal rings
• Zeros of Reliability Polynomials and f-vectors of Matroids
• The strongly connected reliability of complete digraphs

This page was built for publication: The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane