  The independence polynomial of a graph is the generating polynomial for the
number of independent sets of each cardinality and its roots are called
independence roots. We investigate here purely imaginary independence roots. We
show that there are infinitely many connected graphs with purely imaginary
independence roots and that every graph is a subgraph of such a graph. We also
classify every rational purely imaginary number that is an independence root.
