On the stability of independence polynomials

From MaRDI portal




Abstract: The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {em independence roots}. We investigate the stability of such polynomials, that is, conditions under which the roots lie in the left half-plane (all of the real roots of independence polynomial are negative and hence lie in this half-plane). We show stability for all independence polynomials of graphs with independence number at most three, but for larger independence number we show that the independence polynomials can have roots arbitrarily far to the right. We provide families of graphs whose independence polynomials are stable and ones that are not, utilizing various graph operations.









This page was built for publication: On the stability of independence polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753011)