Roots of two‐terminal reliability polynomials
From MaRDI portal
Publication:6087151
Abstract: Assume that the vertices of a graph are always operational, but the edges of are operational independently with probability . For fixed vertices and , the emph{two-terminal reliability} of is the probability that the operational subgraph contains an -path, while the emph{all-terminal reliability} of is the probability that the operational subgraph contains a spanning tree. Both reliabilities are polynomials in , and have very similar behaviour in many respects. However, unlike all-terminal reliability, little is known about the roots of two-reliability polynomials. In a variety of ways, we shall show that the nature and location of the roots of two-terminal reliability polynomials have significantly different properties than those held by roots of the all-terminal reliability.
Recommendations
Cites work
- scientific article; zbMATH DE number 51680 (Why is no real title available?)
- On the log concavity of reliability and matroidal sequences
- On the roots of all-terminal reliability polynomials
- Roots of the Reliability Polynomials
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- The independence fractal of a graph.
- Zeros of Reliability Polynomials and f-vectors of Matroids
This page was built for publication: Roots of two‐terminal reliability polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087151)