Circles and line segments as independence attractors of graphs

Garima Khetawat, Moumita Manna, Tarakanta Nayak

By an independent set in a simple graph $G$, we mean a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$ is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+…