Mercè Mora

Mercè Mora

Auto-generated profile, based on publicly available information

Mercè Mora

Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2007 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
JCJosé Cáceres
José Cáceres
CHCarmen Hernando
Carmen Hernando
MMMercè Mora
Mercè Mora
IPIgnacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
Ignacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
MPMaria Luz Puertas
Maria Luz Puertas
DWDavid R. Wood
David R. Wood
A set of vertices S resolves a graph 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 of G. This paper studies the metric dimension of cartesian products $G\,\square\,H$. We prove that the metric dimension of $G\,\square\,G$ is tied in a strong sense to the minimum order of a so‐called doubly resolving set in G. Using bounds on the order of doubly resolving sets, we establish bounds on $G\,\square\,H$ for many examples of G and H. One of our main results is a family of graphs G with bounded metric dimension for which the metric dimension of $G\,\square\,G$ is unbounded.

5 January 2010 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
CHCarmen Hernando
Carmen Hernando
MMMercè Mora
Mercè Mora
IPIgnacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
Ignacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
CSCarlos Seara
Carlos Seara
DWDavid R. Wood
David R. Wood
A set of vertices $S$ resolves a connected graph $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 of $G$. Let ${\cal G}_{\beta,D}$ be the set of graphs with metric dimension $\beta$ and diameter $D$. It is well-known that the minimum order of a graph in ${\cal G}_{\beta,D}$ is exactly $\beta+D$. The first contribution of this paper is to characterise the graphs in ${\cal G}_{\beta,D}$ with order $\beta+D$ for all values of $\beta$ and $D$. Such a characterisation was previously only known for $D\leq2$ or $\beta\leq1$. The second contribution is to determine the maximum order of a graph in ${\cal G}_{\beta,D}$ for all values of $D$ and $\beta$. Only a weak upper bound was previously known.

1 October 2005 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
CHCarmen Hernando
Carmen Hernando
MMMercè Mora
Mercè Mora
IPIgnacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
Ignacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
CSCarlos Seara
Carlos Seara
JCJosé Cáceres
José Cáceres
MPMaria Luz Puertas
Maria Luz Puertas

1 April 2005 in Discrete Mathematics
Verified
Journal Article
Closed access
CHCarmen Hernando
Carmen Hernando
TJTao Jiang
Tao Jiang
MMMercè Mora
Mercè Mora
IPIgnacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
Ignacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
CSCarlos Seara
Carlos Seara

6 February 2006 in Discrete Mathematics
Verified
Journal Article
Closed access
PDF file
JCJosé Cáceres
José Cáceres
CHCarmen Hernando
Carmen Hernando
MMMercè Mora
Mercè Mora
IPIgnacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
Ignacio M Politècnica de Catalunya (Ignacio Manuel Pelayo Pelayo
MPMaria Luz Puertas
Maria Luz Puertas
CSCarlos Seara
Carlos Seara

1 April 1999 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
MHM.C. Hernando
M.C. Hernando
FHF. Hurtado
F. Hurtado
AMA. Márquez
A. Márquez
MMM. Mora
M. Mora
MNM. Noy
M. Noy