Bipartition Polynomials, the Ising Model, and Domination in Graphs
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 represent...
Збережено в:
| Автори: | , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
University of Zielona Góra
2015-05-01
|
| Серія: | Discussiones Mathematicae Graph Theory |
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.7151/dmgt.1808 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|