Title of article
The Interlace Polynomial of Graphs at − 1
Author/Authors
Balister، نويسنده , , P.N. and Bollobلs، نويسنده , , B. and Cutler، نويسنده , , J. and Pebody، نويسنده , , L.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
7
From page
761
To page
767
Abstract
In this paper we give an explicit formula for the interlace polynomial atx = − 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.
Journal title
European Journal of Combinatorics
Serial Year
2002
Journal title
European Journal of Combinatorics
Record number
1549960
Link To Document