Reducing the domination number of graphs via edge contractions
classification
💻 cs.CC
cs.DMmath.CO
keywords
contractionsdominationedgenumberproblemcomplexitycomputationalconnected
read the original abstract
In this paper, we study the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by at least one using $k$ edge contractions, for some fixed integer $k \geq 0$? We present positive and negative results regarding the computational complexity of this problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.