Pages that link to "Item:Q598476"

The following pages link to The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476):

Displaying 18 items.

• Complete monotonicity for inverse powers of some combinatorially defined polynomials (Q483372) (← links)
• Tutte polynomials of bracelets (Q604825) (← links)
• A little statistical mechanics for the graph theorist (Q973134) (← links)
• Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids (Q1044207) (← links)
• The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane (Q1044980) (← links)
• Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
• Polynomials with the half-plane property and the support theorems (Q1775896) (← links)
• On the roots of domination polynomials (Q2014706) (← links)
• Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
• On the reliability roots of simplicial complexes and matroids (Q2319721) (← links)
• On the roots of all-terminal reliability polynomials (Q2400560) (← links)
• On the roots of strongly connected reliability polynomials (Q3057111) (← links)
• On the Real Roots of Domination Polynomials (Q3391335) (← links)
• The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
• Network reliability: Heading out on the highway (Q6087070) (← links)
• Roots of two‐terminal reliability polynomials (Q6087151) (← links)
• Rational roots of all‐terminal reliability (Q6092650) (← links)
• Reliability polynomials of consecutive‐<i>k</i>‐out‐of‐<i>n</i>:<i>F</i>systems have unbounded roots (Q6139378) (← links)