An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
E. Acosta Troncoso, J. Leaños, L. M. Rivera
·
2026-01-28
·
via math.CO updates on arXiv.org
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)$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
