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 …

The k-token graph F k (G) of a graph G is the graph whose vertices are the k-subsets of
vertices from G, two of which being adjacent whenever their symmetric difference is a pair of …

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 …

The $ k $-token graph $ F_k (G) $ of a graph $ G $ on $ n $ vertices is the graph whose
vertices are the ${n\choose k} $$ k $-subsets of vertices from $ G $, two of which being …

arXiv:2404.02128v1 [math.CO] 2 Apr 2024 Page 1 On factored lifts of graphs and their spectra
∗ C. Dalfóa, MA Fiolb, S. Pavlıkovác, and J. Širánd aDepartament. de Matem`atica Universitat …

We consider lifting eigenvalues and eigenvectors of graphs to their {\em factored lifts},
derived by means of a {\em combined voltage assignment} in a group. The latter extends the …