pith. sign in

arxiv: 1802.02478 · v1 · pith:X7QR2UDPnew · submitted 2018-02-07 · 🧮 math.CO

On the Stability of Independence Polynomials

classification 🧮 math.CO
keywords independencepolynomialsrootsnumberpolynomialstabilitygraphgraphs
0
0 comments X
read the original 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.