For fragile power domination, two graphs with equal-size sensor sets have identical expected observed-vertex polynomials exactly when their k-subset observation sums agree, and gadget constructions can freely control all but the lowest two coefficients.
D´ emonstration du th´ eor` eme de weierstrass fonde´ e sur le calcul des probabilit´ es
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On Fragile Power Domination
For fragile power domination, two graphs with equal-size sensor sets have identical expected observed-vertex polynomials exactly when their k-subset observation sums agree, and gadget constructions can freely control all but the lowest two coefficients.