An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917227059478528 |
|---|---|
| author | Troncoso, E. Acosta Leaños, J. Rivera, L. M. |
| author_facet | Troncoso, E. Acosta Leaños, J. Rivera, L. M. |
| contents | In this note, we show that the domination number of the $2$-token graph of the path graph of order $n\geq 2$ is equal to $\frac{n^2}{10}+Θ(n)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20216 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs Troncoso, E. Acosta Leaños, J. Rivera, L. M. Combinatorics 05C69, 05C76 In this note, we show that the domination number of the $2$-token graph of the path graph of order $n\geq 2$ is equal to $\frac{n^2}{10}+Θ(n)$. |
| title | An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs |
| topic | Combinatorics 05C69, 05C76 |
| url | https://arxiv.org/abs/2601.20216 |