Very well-covered graphs and the unimodality conjecture

Vadim E. Levit, Eugen Mandrescu

If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomia…