#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1997

2018

- This year (0)
- Last 5 years (6)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- José Cáceres, M. Carmen Hernando, +4 authors David R. Wood
- SIAM J. Discrete Math.
- 2006

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… (More)

- M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood
- Electronic Notes in Discrete Mathematics
- 2007

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum… (More)

- José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas
- Computers & Mathematics with Applications
- 2009

A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is… (More)

- José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara
- Discrete Mathematics
- 2006

Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties… (More)

- Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel
- Graph Drawing
- 1997

The main problem considered in this paper is the following: given two trees both with n vertices, whether it is possible to draw them on the plane with the same set of vertices without crossings and… (More)

- M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara
- Discrete Mathematics
- 2005

Given a graph G and a subset [email protected]?V(G), a Steiner W -tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree;… (More)

- M. Carmen Hernando, Ferran Hurtado, Marc Noy
- Graphs and Combinatorics
- 2002

Abstract. Let Pn be a set of n=2m points that are the vertices of a convex polygon, and let ℳm be the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight… (More)

- José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara
- Discrete Applied Mathematics
- 2008

A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. Moreover, if no vertex in the whole graph V(G) is further… (More)

- José Cáceres, María Luz Puertas, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara
- Electronic Notes in Discrete Mathematics
- 2005

Av ertexv is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types… (More)

- M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo
- Eur. J. Comb.
- 2012

A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If… (More)