The k-th token graph of a graph G=(V, E) is the graph F k (G) whose vertices are the k-
subsets of V and whose edges are all pairs of k-subsets A, B such that the symmetric …

Let G be a graph on n vertices. For a given integer k such that 1≤ k≤ n, the k-token graph F
k (G) of G is defined as the graph whose vertices are the k-subsets of the vertex set of G, and …

Let G be a graph on n vertices. The k-token graph (or symmetric k-th power) of G, denoted by
F k (G), has as vertices the nkk-subsets of vertices from G, and two vertices are adjacent …