The power contamination number on grid graphs is exactly determined, a prior conjecture is shown false, recurrences are derived, and optimal-set counts match ternary-word and large Schröder sequences.
Improved algorithms and complexity results for power domination in graphs.Algorithmica, 52(2):177–202, 2008
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Power Contamination Problem on Grids Revisited: Optimality, Combinatorics, and Links to Integer Sequences
The power contamination number on grid graphs is exactly determined, a prior conjecture is shown false, recurrences are derived, and optimal-set counts match ternary-word and large Schröder sequences.