arXiv:1707.05839v2 [math.CO] 2 Oct 2017 Hamiltonicity of token graphs of fan graphs Page 1
arXiv:1707.05839v2 [math.CO] 2 Oct 2017 Hamiltonicity of token graphs of fan graphs Luis …

The token graphs of graphs have been studied at least from the 80's with different names
and by different authors. The Johnson graph J (n, k) is isomorphic to the k-token graph of the …

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 simple graph of order n with vertex set V (G) and edge set E (G), and let k be an
integer such that 1≤ k≤ n− 1. The k-token graph G {k} of G is the graph whose vertices are …

The k-token graph Tk (G) is the graph whose vertices are the k-subsets of vertices of a graph
G, with two vertices of Tk (G) adjacent if their symmetric difference is an edge of G. We …

In 2018, JM Gómez et al. showed that the problem of finding the packing number ρ (F2 (Pn))
of the 2-token graph F2 (Pn) of the path Pn of length n≥ 2 is equivalent to determining the …

The complete double vertex graph $ M_2 (G) $ of $ G $ is defined as the graph whose
vertices are the $2 $-multisubsets of $ V (G) $, and two of such vertices are adjacent in …

Token graphs, or symmetric powers of graphs, see\cite {alavi2002survey} and\cite {Fabila-
Monroy2012}, are defined on the $ k $-combinations of the vertex set of some graph $ L …

Let $ G $ be a simple graph of order $ n $. The double vertex graph $ F_2 (G) $ of $ G $ is
the graph whose vertices are the $2 $-subsets of $ V (G) $, where two vertices are adjacent …

Let $ G=(V, E) $ be a graph. The double vertex graph $ F_2 (G) $ of $ G $ is the graph
whose vertex set consists of all $2$-subsets of $ V (G) $ such that two vertices are adjacent …