Chen–Wang conjecture on independence polynomials of clique-corona graphs

Let $K_{t,n}$ be the complete bipartite graph with parts of sizes $t$ and $n$, and let $K_{t,n}\circ K_1$ denote its corona with $K_1$. Write $I(G;x)$ for the independence polynomial of a graph $G$. Chen–Wang conjecture. For every $t$, the polynomial $I(K_{t,n}\circ K_1;x)$ is log-concave and therefore unimodal. The conjecture was proposed after the corresponding calculation for $K_{2,n}\circ K_1$; the supplied text gives no resolution status.