• Corpus ID: 238259890

Unimodality and monotonic portions of certain domination polynomials

@inproceedings{Burcroff2021UnimodalityAM,
  title={Unimodality and monotonic portions of certain domination polynomials},
  author={Amanda Burcroff and Grace O'Brien},
  year={2021}
}

• Amanda Burcroff, Grace O'Brien
• Published 2 October 2021
• Mathematics

Given a simple graph G on n vertices, a subset of vertices U ⊆ V (G) is dominating if every vertex of V (G) is either in U or adjacent to a vertex of U . The domination polynomial of G is the generating function whose coefficients are the number of dominating sets of a given size. We show that the domination polynomial is unimodal, i.e., the coefficients are nondecreasing and then non-increasing, for several well-known families of graphs. In particular, we prove unimodality for spider graphs with at most 400 legs (of arbitrary length), lollipop graphs, arbitrary direct products of complete graphs, and Cartesian products of two complete graphs. We show that for every graph, a portion of the coefficients are non-increasing, where the size of the portion depends on the upper domination number, and in certain cases this is sufficient to prove unimodality. Furthermore, we study graphs with m universal vertices, i.e., vertices adjacent to every other vertex, and show that the last ( 1 2 − 1 2m+1 )n coefficients of their domination polynomial are non-increasing.