On the roots of strongly connected reliability polynomials

DOI10.1002/net.20301zbMath1207.05094OpenAlexW4238730366MaRDI QIDQ3057111

Karl Dilcher, Jason I. Brown

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20301

zbMATH Keywords

rootsreliabilitydigraphstrongly connectedBrownall terminal reliabilityColbourn conjecture

Mathematics Subject Classification ID

Graph polynomials (05C31) Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Related Items (3)

Network reliability: Heading out on the highway ⋮ Existence of optimally‐greatest digraphs for strongly connected node reliability ⋮ The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the location of roots of independence polynomials
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• The roots of the independence polynomial of a clawfree graph
• Roots of independence polynomials of well covered graphs
• On the chromatic roots of generalized theta graphs
• Random matrices and graphs
• Recursive families of graphs
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Uniformly optimal digraphs for strongly connected reliability
• Roots of the Reliability Polynomials
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• 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
• Chromatic Roots are Dense in the Whole Complex Plane
• On chromatic roots of large subdivisions of graphs

This page was built for publication: On the roots of strongly connected reliability polynomials