Linear transformations between dominating sets in the TAR-model

06/30/2020
by   Nicolas Bousquet, et al.
0

Given a graph G and an integer k, a token addition and removal (TAR for short) reconfiguration sequence between two dominating sets D_ s and D_ t of size at most k is a sequence S= ⟨ D_0 = D_ s, D_1 …, D_ℓ = D_ t⟩ of dominating sets of G such that any two consecutive dominating sets differ by the addition or deletion of one vertex, and no dominating set has size bigger than k. We first improve a result of Haas and Seyffarth, by showing that if k=Γ(G)+α(G)-1 (where Γ(G) is the maximum size of a minimal dominating set and α(G) the maximum size of an independent set), then there exists a linear TAR reconfiguration sequence between any pair of dominating sets. We then improve these results on several graph classes by showing that the same holds for K_ℓ-minor free graph as long as k ≥Γ(G)+O(ℓ√(logℓ)) and for planar graphs whenever k ≥Γ(G)+3. Finally, we show that if k=Γ(G)+tw(G)+1, then there also exists a linear transformation between any pair of dominating sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2021

TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs

We study the dominating set reconfiguration problem with the token slidi...
research
02/22/2018

Efficient Enumeration of Dominating Sets for Sparse Graphs

Dominating sets are fundamental graph structures. However, enumeration o...
research
06/25/2019

On the definition of likelihood function

We discuss a general definition of likelihood function in terms of Radon...
research
07/20/2023

Shortest Dominating Set Reconfiguration under Token Sliding

In this paper, we present novel algorithms that efficiently compute a sh...
research
11/11/2021

A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph

We prove constructively that the maximum possible number of minimal conn...
research
08/05/2023

Independent dominating sets in planar triangulations

In 1996, Matheson and Tarjan proved that every near planar triangulation...
research
03/16/2022

Short and local transformations between (Δ+1)-colorings

Recoloring a graph is about finding a sequence of proper colorings of th...

Please sign up or login with your details

Forgot password? Click here to reset