The bivariate ising polynomial of a graph
2009 (English)In: Discrete Applied Mathematics, ISSN 0166-218X, Vol. 157, no 11, 2515-2524 p.Article in journal (Refereed) Published
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. (C) 2009 Published by Elsevier B.V.
Place, publisher, year, edition, pages
Elsevier, 2009. Vol. 157, no 11, 2515-2524 p.
graph polynomials, ising polynomial, graph invariants, lattice-gas, invariants, maps
IdentifiersURN: urn:nbn:se:umu:diva-31675DOI: 10.1016/J.Dam.2009.02.021ISI: 000266758600001OAI: oai:DiVA.org:umu-31675DiVA: diva2:293869