Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Dominating sets reconfiguration under token sliding

Marthe Bonamy 1 Paul Dorbec 2 Paul Ouvrard 1 
2 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : Let $G$ be a graph and $D_{\sf s}$ and $D_{\sf t}$ be two dominating sets of $G$ of size $k$. Does there exist a sequence $\langle D_0 = D_{\sf s}, D_1, \ldots, D_{\ell-1}, D_\ell = D_{\sf t} \rangle$ of dominating sets of $G$ such that $D_{i+1}$ can be obtained from $D_i$ by replacing one vertex with one of its neighbors? In this paper, we investigate the complexity of this decision problem. We first prove that this problem is PSPACE-complete, even when restricted to split, bipartite or bounded treewidth graphs. On the other hand, we prove that it can be solved in polynomial time on dually chordal graphs (a superclass of both trees and interval graphs) or cographs.
Complete list of metadata
Contributor : Paul Ouvrard Connect in order to contact the contributor
Submitted on : Wednesday, May 19, 2021 - 12:05:37 PM
Last modification on : Sunday, June 26, 2022 - 3:08:34 AM


Files produced by the author(s)


  • HAL Id : hal-02394839, version 2
  • ARXIV : 1912.03127


Marthe Bonamy, Paul Dorbec, Paul Ouvrard. Dominating sets reconfiguration under token sliding. 2021. ⟨hal-02394839v2⟩



Record views


Files downloads