On the 2-Token Graphs of Some Disjoint Union of Graphs

The k-token graph of a given graph G, is the graph which vertex set consists of all k-subsets of the vertex set of G and two vertices are connected by an edge exactly when their difference corresponds to an edge of G. In this paper, we give a description on the structure of the 2-token graph of disjoint union of multiple graphs. This result complements the previous findings regarding the properties of the k-token graphs.