Mercè Mora

collaborators

3 papers

math.CO2026

On Generalized Token Graphs

Xiaodi Song, Cristina DalfÃ³, Miquel Ãngel Fiol +2

The vertices of a $k$ -token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$ . Changing some conditions on both the nature of…

math.CO2026

Metric representations by minimal graphs

VÃctor Franco-SÃ¡nchez, MercÃ¨ Mora, MarÃa Luz Puertas

A resolving set in a graph $G$ is a vertex subset $W = {I ¨ ^{1}, \dots, I ¨ ^{n}} \subseteq V (G)$ such that each $u \in V (G)$ can be uniquely identified by the vector $r(u \vert W) = (d(…

math.CO2025

Upper bounds on the $k$ -isolation number

Peter Borg, Magdalena LemaÅska, MercÃ¨ Mora +1

The isolation number of a graph $G$ (also called the vertex-edge domination number of $G$ ), denoted by $I^^{1} (G)$ , is the size of a smallest subset $D$ of the vertex set $V (G)$ of $G$ …

On Generalized Token Graphs

Metric representations by minimal graphs

Upper bounds on the k-isolation number

Upper bounds on the $k$ -isolation number