On the Unimodality of Independence Polynomials of Very Well-Covered Graphs

Jason I. Brown, Ben Cameron

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every m…