TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs

We study the dominating set reconfiguration problem with the token sliding rule. Let G be a graph \(G=(V,E)\) and two dominating sets \(D_s\) and \(D_t\) of G. The goal is to decide if there exists a sequence \(S=\langle D_1:=D_s,\ldots ,D_{\ell }:=D_t \rangle \) of dominating sets of G such that for any two consecutive dominating sets \(D_r\) and \(D_{r+1}\) with \(r

Keywords:

• Combinatorics
• Sequence
• Mathematics
• Circle graph
• Dominating set
• Graph
• Arc (geometry)

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader