2000 character limit reached
Reducing the domination number of graphs via edge contractions (1903.01800v1)
Published 5 Mar 2019 in cs.CC, cs.DM, and math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
