  The independence equivalence class of a graph $G$ is the set of graphs that
have the same independence polynomial as $G$. Beaton, Brown and Cameron
(arXiv:1810.05317) found the independence equivalence classes of even cycles,
and raised the problem of finding the independence equivalence class of odd
cycles. The problem is completely solved in this paper.
