Roots of the Reliability Polynomials
From MaRDI portal
Publication:4030196
DOI10.1137/0405047zbMath0774.05046OpenAlexW1985431191MaRDI QIDQ4030196
Charles J. Colbourn, Jason I. Brown
Publication date: 1 April 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0405047
Enumeration in graph theory (05C30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
On the roots of total domination polynomial of graphs, The \(k\)-fractal of a simplicial complex, Practical sequential bounds for approximating two-terminal reliability, Zeros of rank-generating functions of Cohen-Macaulay complexes, Non-Stanley bounds for network reliability, Generic and special constructions of pure O -sequences, Matroid inequalities, On the roots of all-terminal reliability polynomials, The Brown-Colbourn conjecture on zeros of reliability polynomials is false, Pure \(O\)-sequences and matroid \(h\)-vectors, 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, Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots, On the structure of the \(h\)-vector of a paving matroid, Tutte polynomials and related asymptotic limiting functions for recursive families of graphs, Homogeneous multivariate polynomials with the half-plane property, Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes, On the shape of a pure 𝑂-sequence, Acyclic polynomials of graphs, On the roots of domination polynomials, Polynomials with the half-plane property and the support theorems, On the roots of strongly connected reliability polynomials, On the roots of Wiener polynomials of graphs, On the reliability roots of simplicial complexes and matroids, Chip firing and all-terminal network reliability bounds, Roots of independence polynomials of well covered graphs, The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane, Chromatic polynomials and order ideals of monomials, Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\), Lexicographic shellability, matroids, and pure order ideals
