The interlace polynomial of graphs at -1
In this paper we give an explicit formula for the interlace polynomial at x = -1 for any graph, and as a result prove a conjecture of Arratia et al. that states that it is always of the form ±2s. We also give a description of the graphs for which s is maximal. © 2002 Published by Elsevier Science Ltd.
European Journal of Combinatorics
Balister, P., Bollobás, B., Cutler, J., & Pebody, L. (2002). The interlace polynomial of graphs at -1. European Journal of Combinatorics, 23 (7), 761-767. https://doi.org/10.1006/eujc.2002.0602