On Reconfiguration Graph of Independent Sets under Token Sliding

03/31/2022
by   David Avis, et al.
0

An independent set of a graph G is a vertex subset I such that there is no edge joining any two vertices in I. Imagine that a token is placed on each vertex of an independent set of G. The 𝖳𝖲- (𝖳𝖲_k-) reconfiguration graph of G takes all non-empty independent sets (of size k) as its nodes, where k is some given positive integer. Two nodes are adjacent if one can be obtained from the other by sliding a token on some vertex to one of its unoccupied neighbors. This paper focuses on the structure and realizability of these reconfiguration graphs. More precisely, we study two main questions for a given graph G: (1) Whether the 𝖳𝖲_k-reconfiguration graph of G belongs to some graph class 𝒢 (including complete graphs, paths, cycles, complete bipartite graphs, and connected split graphs) and (2) If G satisfies some property 𝒫 (including s-partitedness, planarity, Eulerianity, girth, and the clique's size), whether the corresponding 𝖳𝖲- (𝖳𝖲_k-) reconfiguration graph of G also satisfies 𝒫, and vice versa.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2022

On The Complexity of Distance-d Independent Set Reconfiguration

For a fixed positive integer d ≥ 2, a distance-d independent set (DdIS) ...
research
07/14/2018

Token Sliding on Split Graphs

We show that the independent set reconfiguration problem on split graphs...
research
04/12/2022

Galactic Token Sliding

Given a graph G and two independent sets I_s and I_t of size k, the inde...
research
03/22/2022

TS-Reconfiguration of k-Path Vertex Covers in Caterpillars

A k-path vertex cover (k-PVC) of a graph G is a vertex subset I such tha...
research
01/01/2023

A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets

We continue the study of token sliding reconfiguration graphs of indepen...
research
03/25/2022

Independent set reconfiguration on directed graphs

Directed Token Sliding asks, given a directed graph and two sets of pair...
research
06/23/2023

On minimum t-claw deletion in split graphs

For t≥ 3, K_1, t is called t-claw. In minimum t-claw deletion problem ()...

Please sign up or login with your details

Forgot password? Click here to reset