1 problem

Let $G$ be a very well-covered graph of order $n$, meaning that every maximal independent set has size $n/2$, and let … be its independence polynomial. Levit–Mandrescu's conjecture…