On the Real Roots of Domination Polynomials
Combinatorics
2021-01-01 v1
Abstract
A dominating set of a graph of order is a subset of the vertices of such that every vertex is either in or adjacent to a vertex of . The domination polynomial is defined by where is the number of dominating sets in with cardinality . In this paper we show that the closure of the real roots of domination polynomials is .
Cite
@article{arxiv.2012.15193,
title = {On the Real Roots of Domination Polynomials},
author = {Iain Beaton and Jason I. Brown},
journal= {arXiv preprint arXiv:2012.15193},
year = {2021}
}