Reducing the domination number of graphs via edge contractions

Esther Galby; Paloma T. Lima; Bernard Ries

Reducing the domination number of graphs via edge contractions

Computational Complexity 2019-03-06 v1 Discrete Mathematics Combinatorics

Authors: Esther Galby , Paloma T. Lima , Bernard Ries

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.

Keywords

graph domination number edge contraction computational complexity connected graph fixed parameter

Cite

@article{arxiv.1903.01800,
  title  = {Reducing the domination number of graphs via edge contractions},
  author = {Esther Galby and Paloma T. Lima and Bernard Ries},
  journal= {arXiv preprint arXiv:1903.01800},
  year   = {2019}
}

Related papers

View all related →