2 citations · 2 across the 1 of their papers we have counts for
3 papers
math.CO2012★ 2 cited
Locating dominating codes: Bounds and extremal cardinalities
José Cáceres, Carmen Hernando, Mercè Mora +2
In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors cont…
math.CO2009
On the geodetic and the hull numbers in strong product graphs
Jose Caceres, Carmen Hernando, Merce Mora +2
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 o…
math.CO2007
Extremal Graph Theory for Metric Dimension and Diameter
Carmen Hernando, Merce Mora, Ignacio M. Pelayo +2
A set of vertices \emph{resolves} a connected graph if every vertex is uniquely determined by its vector of distances to the vertices in . The \emph{metric dimension} of…