The bivariate Ising polynomial of a graph

DOI10.1016/j.dam.2009.02.021zbMath1211.05059OpenAlexW1982314856MaRDI QIDQ967288

Daniel Andrén, Klas Markström

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.021

zbMATH Keywords

graph invariantsgraph polynomialsIsing polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

The Feynman identity for planar graphs ⋮ Complexity of Ising Polynomials ⋮ Note on the subgraph component polynomial ⋮ On the Potts model partition function in an external field ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ A tree distinguishing polynomial ⋮ New Graph Polynomials from the Bethe Approximation of the Ising Partition Function ⋮ Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” ⋮ Bipartition polynomials, the Ising model, and domination in graphs

Cites Work

• Random triangulations of the plane
• Problems in algebraic combinatorics
• Asymptotic normality determined by high moments, and submap counts of random maps
• Contraction-deletion invariants for graphs
• Graphs determined by polynomial invariants
• Almost all maps are asymmetric
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms
• On Dependency Graphs and the Lattice Gas
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Beitrag zur Theorie des Ferromagnetismus
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item