M. Mora

activity

20052026

most citedOn the Metric Dimension of Cartesian Products of Graphs

473 citations · 540 across the 27 of their papers we have counts for

collaborators

29 papers

math.CO2026

Isolation subdivision number of a graph

Magda Dettlaff, Magdalena Lemańska, Merce Mora +2

For a graph $G = (V, E),$ a set $S \subseteq V$ is called an isolating set of $G$ if the set $V - N [S]$ is independent. The minimum cardinality of an isolating set in $G$ is the isolati…

math.CO2023★ 17 cited

Graphs with isolation number equal to one third of the order

Magdalena Lemanska, Mercè Mora, María José Souto-Salorio

A set $D$ of vertices of a graph $G$ is isolating if the set of vertices not in $D$ or with no neighbor in $D$ is independent. The isolation number of $G$ , denoted by $ι (G)$ , is th…

math.CO2022

Paired and semipaired domination in triangulations

M. Claverol, C. Hernando, M. Maureso +2

A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$ . A dominating set $D$ is paired if the subgr…

math.CO2021★ 4 cited

Resolving sets tolerant to failures in three-dimensional grids

Mercè Mora, María José Souto Salorio, Ana Dorotea Tarrío-Tobar

An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$ . The metric dimens…

math.CO2021★ 3 cited

The Equidistant Dimension of Graphs

A. González, C. Hernando, M. Mora

A subset $S$ of vertices of a connected graph $G$ is a distance-equalizer set if for every two distinct vertices $x, y \in V (G) ∖ S$ there is a vertex $w \in S$ such that…

math.CO2020★ 1 cited

Total domination in plane triangulations

M. Claverol, A. García, G. Hernández +4

A total dominating set of a graph $G = (V, E)$ is a subset $D$ of $V$ such that every vertex in $V$ is adjacent to at least one vertex in $D$ . The total domination number of $G$ , deno…