The parameterized complexity of the equidomination problem

From MaRDI portal
Publication:1687940



Abstract: A graph G=(V,E) is called equidominating if there exists a value tinmathbbN and a weight function omega:VightarrowmathbbN such that the total weight of a subset DsubseteqV is equal to t if and only if D is a minimal dominating set. To decide whether or not a given graph is equidominating is referred to as the Equidomination problem. In this paper we show that two parameterized versions of the Equidomination problem are fixed-parameter tractable: the first parameterization considers the target value t leading to the Target-t Equidomination problem. The second parameterization allows only weights up to a value k, which yields the k-Equidomination problem. In addition, we characterize the graphs whose every induced subgraph is equidominating. We give a finite forbidden induced subgraph characterization and derive a fast recognition algorithm.












This page was built for publication: The parameterized complexity of the equidomination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687940)