English

On the Real Roots of Domination Polynomials

Combinatorics 2021-01-01 v1

Abstract

A dominating set SS of a graph GG of order nn is a subset of the vertices of GG such that every vertex is either in SS or adjacent to a vertex of SS. The domination polynomial is defined by D(G,x)=dkxkD(G,x) = \sum d_k x^k where dkd_k is the number of dominating sets in GG with cardinality kk. In this paper we show that the closure of the real roots of domination polynomials is (,0](-\infty,0].

Keywords

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}
}