Domination number of Token Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909798435389440 |
|---|---|
| author | Fabila-Monroy, Ruy Gómez-Galicia, Sergio Gerardo |
| author_facet | Fabila-Monroy, Ruy Gómez-Galicia, Sergio Gerardo |
| contents | The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertices are all the $k$-subsets of $V(G)$; with two of them adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we study the domination number of the token graphs of the star, $S_n$, and the complete graph, $K_n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_16448 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Domination number of Token Graphs Fabila-Monroy, Ruy Gómez-Galicia, Sergio Gerardo Combinatorics The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertices are all the $k$-subsets of $V(G)$; with two of them adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we study the domination number of the token graphs of the star, $S_n$, and the complete graph, $K_n$. |
| title | Domination number of Token Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.16448 |