3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.CO2016
Shortcut sets for the locus of plane Euclidean networks
José Cáceres, Delia Garijo, Antonio González +3
We study the problem of augmenting the locus of a plane Euclidean network by inserting iteratively a finite set of segments, called \emph{shortcu…
math.CO2009★ 3 cited
On the Metric Dimension of Infinite Graphs
J. Cáceres, C. Hernando, M. Mora +2
A set of vertices \emph{resolves} a graph if every vertex is uniquely determined by its vector of distances to the vertices in . The \emph{metric dimension} of a graph $…
math.CO2005
On the Metric Dimension of Cartesian Products of Graphs
José Cáceres, Carmen Hernando, Mercé Mora +4
A set S of vertices in a graph G resolves 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 cardina…