منابع مشابه
Token Graphs
For a graph G and integer k ≥ 1, we define the token graph Fk(G) to be the graph with vertex set all k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of Fk(G) correspond to configurations of k indistinguishable tokens placed at distinct vertices of G, where two configurations are adjacent whenever...
متن کاملToken Sliding on Chordal Graphs
Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I . We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two independent sets I and J , the TOKEN SLIDING problem consists in deciding whether there exists a sequence of independent sets which transforms I into J so that eve...
متن کاملPermutations Generated by Token Passing in Graphs
A transportation graph is a directed graph with a designated input node and a designated output node. Initially, the input node contains an ordered set of tokens 1,2,3, . . The tokens are removed from the input node in this order and transferred through the graph to the output node in a series of moves; each move transfers a token from a node to an adjacent node. Two or more tokens cannot resid...
متن کاملSliding Token on Bipartite Permutation Graphs
Sliding Token is a natural reconfiguration problem in which vertices of independent sets are iteratively replaced by neighbors. We develop techniques that may be useful in answering the conjecture that Sliding Token is polynomial-time decidable on bipartite graphs. Along the way, we give efficient algorithms for Sliding Token on bipartite permutation and bipartite distance-hereditary graphs.
متن کاملOn the Parameterized Complexity for Token Jumping on Graphs
Suppose that we are given two independent sets I0 and Ir of a graph such that |I0| = |Ir|, and imagine that a token is placed on each vertex in I0. Then, the token jumping problem is to determine whether there exists a sequence of independent sets which transforms I0 into Ir so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2011
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-011-1055-9