Independence Equivalence Classes of Paths and Cycles

Iain Beaton, Jason I. Brown, Ben Cameron

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if t…