Bipartition polynomials, the Ising model, and domination in graphs

DOI10.7151/dmgt.1808zbMath1311.05147OpenAlexW2052404722MaRDI QIDQ2344022

James Preen, Tomer Kotek, Peter Tittmann, Markus Dod

Publication date: 11 May 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1808

zbMATH Keywords

Ising modelgraph polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Graph products of the trivariate total domination polynomial and related polynomials ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Neighborhood and domination polynomials of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination reliability
• Distinguishing graphs by their left and right homomorphism profiles
• The Tutte-Potts connection in the presence of an external magnetic field
• The bivariate Ising polynomial of a graph
• Clique polynomials and independent set polynomials of graphs
• Subset-sum representations of domination polynomials
• Theory of monomer-dimer systems
• Complexity of Ising Polynomials
• A Course in Enumeration
• Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
• On the theory of the matching polynomial
• Mean value for the matching and dominating polynomial
• Domination Polynomials of Graph Products
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Bipartition polynomials, the Ising model, and domination in graphs