arXiv Analytics

Sign in

arXiv:1301.0293 [math.CO]AbstractReferencesReviewsResources

Interlace polynomials and Tutte polynomials

Lorenzo Traldi

Published 2013-01-02, updated 2013-01-27Version 2

Let G be a graph with adjacency matrix A(G). Consider the matrix IA(G)=(I | A(G)), where I is the identity matrix, and let M(IA(G)) be the binary matroid represented by IA(G). Then suitably parametrized versions of the Tutte polynomial of M(IA(G)) yield the interlace polynomials of G, introduced by Arratia, Bollob\'as and Sorkin [J. Combin. Theory Ser. B 92 (2004) 199-233; Combinatorica 24 (2004) 567-584]. Interlace polynomials subsequently introduced by other authors may be obtained from parametrized Tutte polynomials of the binary matroid represented by (I | A(G) | I+A(G)).

Comments: This article has been superseded by arXiv:1301.4946
Categories: math.CO
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:1301.0374 [math.CO] (Published 2013-01-03, updated 2013-01-05)
The triangle-free graphs with rank 6
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh
arXiv:1709.03591 [math.CO] (Published 2017-09-11)
A New Perspective on the Average Mixing Matrix