The Parameterized Complexity of the Equidomination Problem

Oliver Schaudt, Fabian Senger

A graph $G=(V,E)$ is called equidominating if there exists a value $t\in \mathbb{N}$ and a weight function $\omega :V\to \mathbb{N}$ such that the total weight of a subset $D\…