On the roots of all-terminal reliability polynomials

DOI10.1016/j.disc.2017.01.024zbMath1369.05115arXiv1703.10566OpenAlexW2600202171MaRDI QIDQ2400560

Jason I. Brown, L. A. S. Mól

Publication date: 29 August 2017

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

Full work available at URL: https://arxiv.org/abs/1703.10566

zbMATH Keywords

polynomial rootsgraph polynomialsall-terminal reliabilityBrown-Colbourn conjecture

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items (13)

Maximum modulus of independence roots of graphs and trees ⋮ The node cop‐win reliability of unicyclic and bicyclic graphs ⋮ Network reliability: Heading out on the highway ⋮ Roots of two‐terminal reliability polynomials ⋮ Rational roots of all‐terminal reliability ⋮ On the Real Roots of Domination Polynomials ⋮ On the split reliability of graphs ⋮ Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots ⋮ On the roots of the subtree polynomial ⋮ Invulnerability of planar two-tree networks ⋮ Acyclic polynomials of graphs ⋮ On the roots of Wiener polynomials of graphs ⋮ On the reliability roots of simplicial complexes and matroids

Cites Work

• Unnamed Item
• Unnamed Item
• \( h\)-vectors of matroids and logarithmic concavity
• On the location of roots of independence polynomials
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
• On the Eneström-Kakeya theorem and its sharpness
• Chip firing and the Tutte polynomial
• Homogeneous multivariate polynomials with the half-plane property
• On the roots of domination polynomials
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• Roots of the Reliability Polynomials
• Zeros of Reliability Polynomials and f-vectors of Matroids
• Chromatic Roots are Dense in the Whole Complex Plane

This page was built for publication: On the roots of all-terminal reliability polynomials