The domination polynomial of powers of paths and cycles

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.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics
Published
2026-11-16
DOI
https://doi.org/10.1016/j.disc.2026.115520
Citations
1
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

The domination polynomial of powers of paths and cycles

Yufei Zhang
1 citations
Discrete Mathematics
Advanced Graph Theory Research
article

The domination polynomial of powers of paths and cycles

Yufei Zhang
article en
1 citations

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.

Discrete MathematicsVol. 350(3)
University of Notre Dame (US)
Simons Foundation
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon