The domination polynomial of powers of paths and cycles
Year: 2026
Type: article
Abstract: A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to an element of the set. The domination sequence of the graph is the sequence whose k th term is the number of dominating sets of size k . Alikhani and Peng have conjectured that the domination sequence of every graph is unimodal. Beaton and Brown verified this conjecture for paths and cycles. Here we extend this to arbitrary powers of paths and cycles, along the way extending a general criterion for unimodality introduced by Beaton and Brown.
Source: Discrete Mathematics
Authors: David Galvin, Yufei Zhang
Institution: University of Notre Dame
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,320
Funder: Simons Foundation
OpenAlex ID: W4402698816
