The bivariate Ising polynomial of a graph

In this paper we discuss the two variable Ising polynomials in a graph theoretical setting. This polynomial has its origin in physics as the partition function of the Ising model with an external field. We prove some basic properties of the Ising polynomial and demonstrate that it encodes a large amount of combinatorial information about a graph. We also give examples which prove that certain properties, such as the chromatic number, are not determined by the Ising polynomial. Finally we prove that there exist large families of non-isomorphic planar triangulations with identical Ising polynomial.

[1]  E. Ising.  Beitrag zur Theorie des Ferromagnetismus , 1925 .

[2]  Nicholas C. Wormald,et al.  Asymptotic normality determined by high moments, and submap counts of random maps , 2004 .

[3]  T. D. Lee,et al.  Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model , 1952 .

[4]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[5]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[6]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[7]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[8]  Nicholas C. Wormald,et al.  Almost All Maps Are Asymmetric , 1995, J. Comb. Theory, Ser. B.

[9]  A. Scott,et al.  The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma , 2003, cond-mat/0309352.

[10]  Klas Markström,et al.  Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms , 2008 .

[11]  Geoffrey Grimmett.  The Random-Cluster Model , 2002, math/0205237.

[12]  Béla Bollobás,et al.  Contraction-Deletion Invariants for Graphs , 2000, J. Comb. Theory B.

[13]  Nicholas C. Wormald,et al.  Random Triangulations of the Plane , 1988, Eur. J. Comb..

[14]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[15]  Chris D. Godsil,et al.  ALGEBRAIC COMBINATORICS , 2013 .

[16]  William T. Tutte.  A Ring in Graph Theory , 1947 .

[17]  Alan D. Sokal,et al.  On Dependency Graphs and the Lattice Gas , 2006, Combinatorics, Probability and Computing.

[18]  Marc Noy,et al.  Graphs determined by polynomial invariants , 2003, Theor. Comput. Sci..

[19]  William T. Tutte.  Graph theory as I have known it , 1998, Oxford lecture series in mathematics and its applications.

[20]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .