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\ge 2$ is equal to $\frac{n^2}{10}+\Theta (n)$.

10 pages