Roots of the Reliability Polynomials
From MaRDI portal
Recommendations
- On the roots of all-terminal reliability polynomials
- On the roots of strongly connected reliability polynomials
- On the roots of the node reliability polynomial
- 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
Cited in
(47)- Chip firing and all-terminal network reliability bounds
- The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
- On the log concavity of reliability and matroidal sequences
- Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
- Homogeneous multivariate polynomials with the half-plane property
- Roots of independence polynomials of well covered graphs
- Chromatic polynomials and order ideals of monomials
- Polynomials with the half-plane property and the support theorems
- The k-fractal of a simplicial complex
- Zeros of rank-generating functions of Cohen-Macaulay complexes
- Non-Stanley bounds for network reliability
- Matroid inequalities
- On the roots of domination polynomials
- Maximum modulus of independence roots of graphs and trees
- On the reliability roots of simplicial complexes and matroids
- Lexicographic shellability, matroids, and pure order ideals
- Practical sequential bounds for approximating two-terminal reliability
- On the roots of all-terminal reliability polynomials
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
- Generic and special constructions of pure O-sequences
- On the roots of strongly connected reliability polynomials
- Distinguished vertices in probabilistic rooted graphs
- scientific article; zbMATH DE number 5944468 (Why is no real title available?)
- On the real roots of domination polynomials
- Combinatorial Properties of a Rooted Graph Polynomial
- Pure O-sequences and matroid h-vectors
- Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
- On the structure of the \(h\)-vector of a paving matroid
- Zeros of Reliability Polynomials and f-vectors of Matroids
- Geometric properties of reliability polynomials
- On the roots of the node reliability polynomial
- Inflection points of reliability polynomials are dense in \([0,1]\)
- On the roots of total domination polynomial of graphs
- Acyclic polynomials of graphs
- On the shape of a pure O-sequence
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- 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
- Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots
- A generalization of the Beraha-Kahane-Weiss theorem with graph polynomial applications
- On the roots of degree polynomials
- Characterization of locally most split reliable graphs
- On the real reliability roots of graphs
- On the roots of Wiener polynomials of graphs
- Network connectivity analysis via shortest paths
This page was built for publication: Roots of the Reliability Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030196)
