Mercè Mora

activity

20172026

collaborators

5 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 = {ω^{1}, \dots, ω^{n}} \subseteq V (G)$ such that each $u \in V (G)$ can be uniquely identified by the vector $r(u \vert W) = (d(u,…

math.CO2024

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 $ι (G)$ , is the size of a smallest subset $D$ of the vertex set $V (G)$ of $G$ …

math.CO2024

Antimagic and product antimagic graphs with pendant edges

Mercè Mora, Joaquín Tey

Let $G = (V, E)$ be a simple graph of size $m$ and $L$ a set of $m$ distinct real numbers. An $L$ -labeling of $G$ is a bijection $ϕ : E \to L$ . We say that $ϕ$ is an antimagic…

math.CO2017

Resolving dominating partitions in graphs

Carmen Hernando, Mercè Mora, Ignacio M. Pelayo

A partition $Π = {S_{1}, \dots, S_{k}}$ of the vertex set of a connected graph $G$ is called a \emph{resolving partition} of $G$ if for every pair of vertices $u$ and $v$ , $d(u,S_j)\neq…

On Generalized Token Graphs

Metric representations by minimal graphs

Upper bounds on the k-isolation number

Antimagic and product antimagic graphs with pendant edges

Resolving dominating partitions in graphs

Upper bounds on the $k$ -isolation number