The bivariate Ising polynomial of a graph

Discrete Applied Mathematics

Volumn 157, Issue 11, 2009, Pages 2515-2524

  Andrén, Daniel ^a   Markström, Klas ^a  

^a Umeå universitet ^*  (Sweden)

Author keywords

Graph invariants; Graph polynomials; Ising polynomial

Indexed keywords

BASIC PROPERTIES; BIVARIATE; CHROMATIC NUMBERS; EXTERNAL FIELDS; GRAPH INVARIANTS; GRAPH POLYNOMIALS; ISING POLYNOMIAL; PARTITION FUNCTIONS; PLANAR TRIANGULATIONS;

ISING MODEL;

POLYNOMIAL APPROXIMATION;

EID: 67349218979     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.02.021     Document Type: Article

References (22)

1. Bollobás B., Pebody L., and Riordan O. Contraction-deletion invariants for graphs. J. Combin. Theory Ser. B 80 2 (2000) 320-345
2. Fortuin C.M., and Kasteleyn P.W. On the random-cluster model. I. Introduction and relation to other models. Physica 57 (1972) 536-564
3. Freedman M., Lovász L., and Schrijver A. Reflection positivity, rank connectivity, and homomorphism of graphs. J. Amer. Math. Soc. 20 1 (2007) 37-51 electronic
4. Gao Z., and Wormald N.C. Asymptotic normality determined by high moments, and submap counts of random maps. Probab. Theory Related Fields 130 3 (2004) 368-376
5. Godsil C.D. Algebraic combinatorics (1993), Chapman & Hall, New York Chapter 2
6. Grimmett G. The random-cluster model. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] vol. 333 (2006), Springer-Verlag, Berlin
7. Ising E. Beitrag zur Theorie des Ferromagnetismus. Z. Physik 31 (1925) 253-258
8. Lee T.D., and Yang C.N. Statistical theory of equations of state and phase transitions. II. Lattice gas and Ising model. Physical Rev. (2) 87 (1952) 410-419
9. Lundow P.H., and Markström K. Exact and approximate compression of transfer matrices for graph homomorphisms. LMS J. Comput. Math. 11 (2008) 1-14
10. McKay B.D. On the spectral characterisation of trees. Ars Combinatoria 3 (1977) 219-232
11. Noy M. Graphs determined by polynomial invariants. Theoret. Comput. Sci. 307 2 (2003) 365-384 Random generation of combinatorial objects and bijective combinatorics
12. Read R.C., and Tutte W.T. Chromatic polynomials. Selected topics in graph theory, 3 (1988), Academic Press, San Diego, CA 15-42
13. Reed B.A. Algorithmic aspects of tree width. Recent advances in algorithms and combinatorics. CMS Books Math./Ouvrages Math. SMC vol. 11 (2003), Springer, New York 85-107
14. Richmond L.B., and Wormald N.C. Almost all maps are asymmetric. J. Combin. Theory Ser. B 63 1 (1995) 1-7
15. Richmond L.B., and Wormald N.C. Random triangulations of the plane. European J. Combin. 9 1 (1988) 61-71
16. Scott A.D., and Sokal A.D. The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma. J. Stat. Phys. 118 5-6 (2005) 1151-1261
17. Scott A.D., and Sokal A.D. On dependency graphs and the lattice gas. Combin. Probab. Comput. 15 1-2 (2006) 253-279
18. Sokal A.D. The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. Surveys in combinatorics 2005. London Math. Soc. Lecture Note Ser. vol. 327 (2005), Cambridge Univ. Press, Cambridge 173-226
19. Tutte W.T. A ring in graph theory. Proc. Cambridge Philos. Soc. 43 (1947) 26-40
20. Tutte W.T. Graph theory as I have known it. Oxford Lecture Series in Mathematics and its Applications vol. 11 (1998), The Clarendon Press Oxford University Press, New York With a foreword by U. S. R. Murty.
21. van der Waerden B.L. Die lange reichweite der regelmassigen atomanordnung in mischkristallen. Zeitschrift fur Physik 118 (1941) 473
22. Welsh D.J.A. Complexity: knots, colourings and counting. London Mathematical Society Lecture Note Series vol. 186 (1993), Cambridge University Press, Cambridge