论文信息 - On the Roots of Expected Independence Polynomials

On the Roots of Expected Independence Polynomials

The independence polynomial of a (finite) graph is the generating function for the number of independent sets of each cardinality. Assuming that each possible edge of a complete graph of order n is independently operational with probability p, we consider the expected independence polynomial. We show here that for all fixed , the expected independence polynomials of complete graphs have all real, simple roots.

Jason I. Brown | Karl Dilcher | Dante V. Manna

[1] Vadim E. Levit,et al. The independence polynomial of a graph - a survey , 2005 .

[2] Jason I. Brown,et al. Average independence polynomials , 2005, J. Comb. Theory, Ser. B.

[3] M. Marden. Geometry of Polynomials , 1970 .

[4] Paul D. Seymour,et al. The roots of the independence polynomial of a clawfree graph , 2007, J. Comb. Theory B.

[5] Jason I. Brown,et al. Roots of Independence Polynomials of Well Covered Graphs , 2000 .