Key points are not available for this paper at this time.
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 something in the set. The domination sequence of the graph is the sequence whose kth 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.
Galvin et al. (Thu,) studied this question.