Reducing the domination number of graphs via edge contractions

03/05/2019
by   Esther Galby, et al.
0

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 ≥ 0? We present positive and negative results regarding the computational complexity of this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2021

Using edge contractions to reduce the semitotal domination number

In this paper, we consider the problem of reducing the semitotal dominat...
research
10/27/2020

Reducing the domination number of P_3+kP_2-free graphs via one edge contraction

In this note, we consider the following problem: given a connected graph...
research
06/28/2019

Blocking dominating sets for H-free graphs via edge contractions

In this paper, we consider the following problem: given a connected grap...
research
11/07/2017

Learning Overcomplete HMMs

We study the problem of learning overcomplete HMMs---those that have man...
research
09/18/2020

Blocking total dominating sets via edge contractions

In this paper, we study the problem of deciding whether the total domina...
research
01/21/2022

Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules

A finite dynamical system with n components is a function f:X→ X where X...
research
11/05/2021

Strong Recovery In Group Synchronization

The group synchronization problem is to estimate unknown group elements ...

Please sign up or login with your details

Forgot password? Click here to reset