On supertoken graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918432639811584 |
|---|---|
| author | Reyes, Mónica A. Dalfó, Cristina Fiol, Miquel Àngel |
| author_facet | Reyes, Mónica A. Dalfó, Cristina Fiol, Miquel Àngel |
| contents | 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 $p$-augmented 2-token graphs of cycles, and study their properties, including the spectral radius or largest adjacency eigenvalue. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_06164 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On supertoken graphs Reyes, Mónica A. Dalfó, Cristina Fiol, Miquel Àngel Combinatorics 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 $p$-augmented 2-token graphs of cycles, and study their properties, including the spectral radius or largest adjacency eigenvalue. |
| title | On supertoken graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.06164 |