On Generalized Token Graphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Song, Xiaodi, Dalfó, Cristina, Fiol, Miquel Àngel, Mora, Mercè, Zhang, Shenggui
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917386534256640
author Song, Xiaodi
Dalfó, Cristina
Fiol, Miquel Àngel
Mora, Mercè
Zhang, Shenggui
author_facet Song, Xiaodi
Dalfó, Cristina
Fiol, Miquel Àngel
Mora, Mercè
Zhang, Shenggui
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_04845
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On Generalized Token Graphs
Song, Xiaodi
Dalfó, Cristina
Fiol, Miquel Àngel
Mora, Mercè
Zhang, Shenggui
Combinatorics
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.
title On Generalized Token Graphs
topic Combinatorics
url https://arxiv.org/abs/2604.04845