Mercè Mora
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Mercè Mora has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Carmen Hernando
Univ Politecn Cataluna, Dept Matemat, Barcelona, Spain
40 shared publications - Ignacio M. Pelayo
Departament de Matemàtiques Universitat Politècnica de Catalunya Spain
33 shared publications - María Luz Puertas
Departamento de Matemáticas, Universidad de Almería, Almería, Spain
21 shared publications - Carlos Seara
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain
18 shared publications - José Cáceres
Departmento de Matemáticas Universidad de Almería Spain
10 shared publications José Cáceres
Department of Mathematics Universidad de Almería Spain
6 shared publications
Latest Publications
- Open Access
- 6 July 2026
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 26 (3) , #P3.10
Domination in cylindrical graphs
AMC is a journal published by University of Primorska.
- 6 July 2026
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 26 (3) , #P3.10
Open AccessDomination in cylindrical graphs
AMC is a journal published by University of Primorska.
- Open Access
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (2) , 721-738
On generalized token graphs
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 the tokens and the number of tokens allowed in each vertex of G, we define a generalization of token graphs, which we call generalized token graphs or simply supertoken graphs, which have different applications. Depending on the above conditions, different families of graphs (such as the Cartesian k-th power of G by itself) are obtained, and we present some of their properties, including order, size, and connectivity.
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (2) , 721-738
Open AccessOn generalized token graphs
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 the tokens and the number of tokens allowed in each vertex of G, we define a generalization of token graphs, which we call generalized token graphs or simply supertoken graphs, which have different applications. Depending on the above conditions, different families of graphs (such as the Cartesian k-th power of G by itself) are obtained, and we present some of their properties, including order, size, and connectivity.
- Open Access
- 5 December 2025
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 23 (1) , 27
Antimagic and Product Antimagic Graphs with Pendant Edges
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 $$\phi : E \rightarrow L$$ . We say that $$\phi $$ is an antimagic L -labeling if the induced vertex sum $$\phi _+: V \rightarrow {\mathbb {R}}$$ defined as $$\phi _+(u)=\sum _{uv\in E}\phi (uv)$$ is injective. Similarly, $$\phi $$ is a product antimagic L-labeling of G if the induced vertex product $$\phi _{\circ }: V \rightarrow {\mathbb {R}}$$ defined as $$\phi _{\circ }(u)=\prod _{uv\in E}\phi (uv)$$ is injective. A graph G is antimagic (resp. product antimagic ) if it has an antimagic (resp. a product antimagic) L -labeling for $$L=\{1,2,\dots ,m\}$$ . Hartsfield and Ringel conjectured that every simple connected graph distinct from $$K_2$$ is antimagic, but the conjecture remains widely open. We prove, among other results, that every connected graph of size m , $$m \ge 3$$ , admits an antimagic L -labeling for every arithmetic sequence L of m positive real numbers, if every vertex of degree at least three is a support vertex. As a corollary, we derive that these graphs are antimagic, reinforcing the veracity of the conjecture by Hartsfield and Ringel. Moreover, these graphs admit also a product antimagic L -labeling provided that the smallest element of L is at least one. The proof is constructive.- 5 December 2025
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 23 (1) , 27
Open AccessAntimagic and Product Antimagic Graphs with Pendant Edges
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 $$\phi : E \rightarrow L$$ . We say that $$\phi $$ is an antimagic L -labeling if the induced vertex sum $$\phi _+: V \rightarrow {\mathbb {R}}$$ defined as $$\phi _+(u)=\sum _{uv\in E}\phi (uv)$$ is injective. Similarly, $$\phi $$ is a product antimagic L-labeling of G if the induced vertex product $$\phi _{\circ }: V \rightarrow {\mathbb {R}}$$ defined as $$\phi _{\circ }(u)=\prod _{uv\in E}\phi (uv)$$ is injective. A graph G is antimagic (resp. product antimagic ) if it has an antimagic (resp. a product antimagic) L -labeling for $$L=\{1,2,\dots ,m\}$$ . Hartsfield and Ringel conjectured that every simple connected graph distinct from $$K_2$$ is antimagic, but the conjecture remains widely open. We prove, among other results, that every connected graph of size m , $$m \ge 3$$ , admits an antimagic L -labeling for every arithmetic sequence L of m positive real numbers, if every vertex of degree at least three is a support vertex. As a corollary, we derive that these graphs are antimagic, reinforcing the veracity of the conjecture by Hartsfield and Ringel. Moreover, these graphs admit also a product antimagic L -labeling provided that the smallest element of L is at least one. The proof is constructive. - 1 November 2024
- Published by IATED Academy
- Vol. 1, 7889-7899
A BLENDED LEARNING/TEACHING METHODOLOGY CASE STUDY IN THE CONTEXT OF THE ENGIMATH@UPC+ INNOVATION PROJECT
- 1 November 2024
- Published by IATED Academy
- Vol. 1, 7889-7899
A BLENDED LEARNING/TEACHING METHODOLOGY CASE STUDY IN THE CONTEXT OF THE ENGIMATH@UPC+ INNOVATION PROJECT
- Open Access
On the metric representation of the vertices of a graph
The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W=\{ω_1, \dots , ω_n\}\subset V(G)$ is the vector of distances $r(u\vert W)=(d(u,ω_1), \dots , d(u,ω_n))$. A vertex subset $W$ is a resolving set of $G$ if $r(u\vert W)\neq r(v\vert W)$, for every $u,v\in V(G)$ with $u\neq v$. Thus, a resolving set with $n$ elements provides a set of metric representation vectors $S\subset \mathbb{Z}^n$ with cardinal equal to the order of the graph. In this paper, we address the reverse point of view, that is, we characterize the finite subsets $S\subset \mathbb{Z}^n$ that are realizable as the set of metric representation vectors of a graph $G$ with respect to some resolving set $W$. We also explore the role that the strong product of paths plays in this context. Moreover, in the case $n=2$, we characterize the sets $S\subset \mathbb{Z}^2$ that are uniquely realizable as the set of metric representation vectors of a graph $G$ with respect to a resolving set $W$.Open AccessOn the metric representation of the vertices of a graph
The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W=\{ω_1, \dots , ω_n\}\subset V(G)$ is the vector of distances $r(u\vert W)=(d(u,ω_1), \dots , d(u,ω_n))$. A vertex subset $W$ is a resolving set of $G$ if $r(u\vert W)\neq r(v\vert W)$, for every $u,v\in V(G)$ with $u\neq v$. Thus, a resolving set with $n$ elements provides a set of metric representation vectors $S\subset \mathbb{Z}^n$ with cardinal equal to the order of the graph. In this paper, we address the reverse point of view, that is, we characterize the finite subsets $S\subset \mathbb{Z}^n$ that are realizable as the set of metric representation vectors of a graph $G$ with respect to some resolving set $W$. We also explore the role that the strong product of paths plays in this context. Moreover, in the case $n=2$, we characterize the sets $S\subset \mathbb{Z}^2$ that are uniquely realizable as the set of metric representation vectors of a graph $G$ with respect to a resolving set $W$. - 1 July 2024
- Published by IATED Academy in EDULEARN Proceedings
- Vol. 1, 5217-5226
ENGIMATH@UPC+: A STEP FORWARD FROM ONLINE SELF LEARNING TO BLENDED LEARNING
- 1 July 2024
- Published by IATED Academy in EDULEARN Proceedings
- Vol. 1, 5217-5226
ENGIMATH@UPC+: A STEP FORWARD FROM ONLINE SELF LEARNING TO BLENDED LEARNING
- 12 September 2023
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 46 (6) , 1-16
On the Metric Representation of the Vertices of a Graph
- 12 September 2023
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 46 (6) , 1-16
On the Metric Representation of the Vertices of a Graph
- 1 January 2023
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 43 (3) , 659-675
The neighbor-locating-chromatic number of trees and unicyclic graphs
- 1 January 2023
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 43 (3) , 659-675
The neighbor-locating-chromatic number of trees and unicyclic graphs
- Open Access
- 11 July 2022
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 19 (4) , 1-19
Resolving sets tolerant to failures in three-dimensional grids
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 dimension of G is the minimum cardinality of a resolving set. In this paper we study resolving sets tolerant to several failures in three-dimensional grids. Concretely, we seek for minimum cardinality sets that are resolving after removing any k vertices from the set. This is equivalent to finding $$(k+1)$$ -resolving sets, a generalization of resolving sets, where, for every pair of vertices, the vector of distances to the vertices of the set differs in at least $$k+1$$ coordinates. This problem is also related with the study of the $$(k+1)$$ -metric dimension of a graph, defined as the minimum cardinality of a $$(k+1)$$ -resolving set. In this work, we first prove that the metric dimension of a three-dimensional grid is 3 and establish some properties involving resolving sets in these graphs. Secondly, we determine the values of $$k\ge 1$$ for which there exists a $$(k+1)$$ -resolving set and construct such a resolving set of minimum cardinality in almost all cases.- 11 July 2022
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 19 (4) , 1-19
Open AccessResolving sets tolerant to failures in three-dimensional grids
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 dimension of G is the minimum cardinality of a resolving set. In this paper we study resolving sets tolerant to several failures in three-dimensional grids. Concretely, we seek for minimum cardinality sets that are resolving after removing any k vertices from the set. This is equivalent to finding $$(k+1)$$ -resolving sets, a generalization of resolving sets, where, for every pair of vertices, the vector of distances to the vertices of the set differs in at least $$k+1$$ coordinates. This problem is also related with the study of the $$(k+1)$$ -metric dimension of a graph, defined as the minimum cardinality of a $$(k+1)$$ -resolving set. In this work, we first prove that the metric dimension of a three-dimensional grid is 3 and establish some properties involving resolving sets in these graphs. Secondly, we determine the values of $$k\ge 1$$ for which there exists a $$(k+1)$$ -resolving set and construct such a resolving set of minimum cardinality in almost all cases. - Open Access
- 6 May 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 45 (4) , 1757-1775
The Equidistant Dimension of Graphs
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) {\setminus } S$$ there is a vertex $$w \in S$$ such that the distances from x and y to w are the same. The equidistant dimension of G is the minimum cardinality of a distance-equalizer set of G. This paper is devoted to introduce this parameter and explore its properties and applications to other mathematical problems, not necessarily in the context of graph theory. Concretely, we first establish some bounds concerning the order, the maximum degree, the clique number, and the independence number, and characterize all graphs attaining some extremal values. We then study the equidistant dimension of several families of graphs (complete and complete multipartite graphs, bistars, paths, cycles, and Johnson graphs), proving that, in the case of paths and cycles, this parameter is related to 3-AP-free sets. Subsequently, we show the usefulness of distance-equalizer sets for constructing doubly resolving sets.- 6 May 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 45 (4) , 1757-1775
Open AccessThe Equidistant Dimension of Graphs
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) {\setminus } S$$ there is a vertex $$w \in S$$ such that the distances from x and y to w are the same. The equidistant dimension of G is the minimum cardinality of a distance-equalizer set of G. This paper is devoted to introduce this parameter and explore its properties and applications to other mathematical problems, not necessarily in the context of graph theory. Concretely, we first establish some bounds concerning the order, the maximum degree, the clique number, and the independence number, and characterize all graphs attaining some extremal values. We then study the equidistant dimension of several families of graphs (complete and complete multipartite graphs, bistars, paths, cycles, and Johnson graphs), proving that, in the case of paths and cycles, this parameter is related to 3-AP-free sets. Subsequently, we show the usefulness of distance-equalizer sets for constructing doubly resolving sets.