Roots of two‐terminal reliability polynomials
From MaRDI portal
Publication:6087151
DOI10.1002/net.22004zbMath1528.05070arXiv2006.09908OpenAlexW3098853299MaRDI QIDQ6087151
Jason I. Brown, Unnamed Author
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.09908
Graph polynomials (05C31) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- On the log concavity of reliability and matroidal sequences
- The independence fractal of a graph.
- On the roots of all-terminal reliability polynomials
- Roots of the Reliability Polynomials
- Zeros of Reliability Polynomials and f-vectors of Matroids
This page was built for publication: Roots of two‐terminal reliability polynomials