Affordable Access

Publisher Website

The Interlace Polynomial of Graphs at− 1

Authors
Journal
European Journal of Combinatorics
0195-6698
Publisher
Elsevier
Publication Date
Volume
23
Issue
7
Identifiers
DOI: 10.1006/eujc.2002.0602

Abstract

Abstract 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 ± 2 s . We also give a description of the graphs for which s is maximal.

There are no comments yet on this publication. Be the first to share your thoughts.