On supertoken graphs
Combinatorics
2026-04-08 v1
Abstract
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some bounds and exact values on the independence number, clique number, and chromatic number of these graphs. Finally, we construct a new infinite family of graphs, which we call the -augmented 2-token graphs of cycles, and study their properties, including the spectral radius or largest adjacency eigenvalue.
Cite
@article{arxiv.2604.06164,
title = {On supertoken graphs},
author = {Mónica A. Reyes and Cristina Dalfó and Miquel Àngel Fiol},
journal= {arXiv preprint arXiv:2604.06164},
year = {2026}
}