M. L. Puertas

collaborators

2 papers

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.CO2024

On the metric representation of the vertices of a graph

MercÃ¨ Mora, MarÃa Luz Puertas

The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W = {I ¨ _{1}, \dots, I ¨ _{n}} \subset V (G)$ is the vector of distances $r(u\vert W…