The interlace polynomial of graphs at \(-1\)
From MaRDI portal
Publication:1864589
DOI10.1006/eujc.2002.0602zbMath1017.05076OpenAlexW2031388593MaRDI QIDQ1864589
Luke Pebody, Béla Bollobás, Jonathan Cutler, Paul N. Balister
Publication date: 18 March 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2002.0602
Related Items (16)
Interlace polynomials of lollipop and tadpole graphs ⋮ The domination polynomial of a graph at \(-1\) ⋮ The adjacency matroid of a graph ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ Interlace polynomials of 4n-snowflake graphs ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ Binary matroids and local complementation ⋮ On the linear algebra of local complementation ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS ⋮ Weighted Interlace Polynomials ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ A simple proof of an inequality connecting the alternating number of independent sets and the decycling number ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ The interlace polynomial of a graph ⋮ Interlace polynomials of friendship graphs
Cites Work
This page was built for publication: The interlace polynomial of graphs at \(-1\)