On Generalized Token Graphs

Abstract

The vertices of a k-token graph of a graph G correspond to k indistinguishable tokens placed on k different vertices of G. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex of G, we define a generalization of token graphs, which we call generalized token graphs or simply supertoken graphs, which have different applications. Depending on the above conditions, different families of graphs (such as the Cartesian k-th power of G by itself) are obtained, and we present some of their properties, including order, size, and connectivity.