On the Stability of Independence Polynomials

Jason I. Brown, Ben Cameron


The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We investigate the stability of such polynomials, that is, conditions under which the independence roots lie in the left half-plane. We use results from complex analysis to determine graph operations that result in a stable or nonstable independence polynomial. In particular, we prove that every graph is an induced subgraph of a graph with stable independence polynomial. We also show that the independence polynomials of graphs with independence number at most three are necessarily stable, but for larger independence number, we show that the independence polynomials can have roots arbitrarily far to the right.


Graph; Independent set; Independence polynomial; Stable polynomial; Root

Full Text: