On the roots of $\sigma$-polynomials

Jason Brown, Aysel Erey

Given a graph $G$ of order $n$, the $\sigma$-$polynomial$ of $G$ is the generating function $\sigma (G,x)=\sum a_i{x}^i$ where $a_i$ is the number of partitions of the vertex set of $G$…