An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
Abstract
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)$.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Complexity and Algorithms in Graphs
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 28 January 2026
- Document type
- Preprint