2013/01/02 by Lorenzo Traldi, Traldi, Lorenzo
Computer Science · Engineering · Mathematics · #05C50 #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1301.0293
openalex publication_date 2013/01/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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ás 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)).