L. M. Rivera

collaborators

2 papers

math.CO2026

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

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)$ .

math.CO2025

Independence numbers of the 2-token graphs of some join graphs

Luis Manuel Rivera, Gerardo Vazquez Briones

The $2$ -token graph $F_{2} (G)$ of a graph $G$ is the graph whose set of vertices consists of all the $2$ -subsets of $V (G)$ , where two vertices are adjacent if and only if their symme…

An asymptotically tight upper bound for the domination number of the 2-token graph of path graphs

Independence numbers of the 2-token graphs of some join graphs

An asymptotically tight upper bound for the domination number of the $2$ -token graph of path graphs