- Tytuł:
- Bipartition Polynomials, the Ising Model, and Domination in Graphs
- Autorzy:
-
Dod, Markus
Kotek, Tomer
Preen, James
Tittmann, Peter - Tematy:
-
domination
Ising model
graph polynomial - Pokaż więcej
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Powiązania:
- https://bibliotekanauki.pl/articles/31339472.pdf Link otwiera się w nowym oknie
- Opis:
- This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph invariants. We apply this approach to show that, analogously to the Tutte polynomial, the Ising polynomial introduced by Andrén and Markström in [3], can be represented as a sum over spanning forests.
- Dostawca treści:
- Biblioteka Nauki
Artykuł