53 citations · 115 across the 9 of their papers we have counts for
10 papers
Computing optimal shortcuts for networks
Delia Garijo, Alberto Márquez, Natalia Rodríguez +1
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. P…
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…
The resolving number of a graph
Delia Garijo, Antonio González, Alberto Márquez
We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important…
On the metric dimension, the upper dimension and the resolving number of graphs
Delia Garijo, Antonio González, Alberto Márquez
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We first answer a question raised by Chartrand and Zhang askin…
Resolving sets for Johnson and Kneser graphs
Robert F. Bailey, José Cáceres, Delia Garijo +4
A set of vertices in a graph is a {\em resolving set} for if, for any two vertices , there exists such that the distances . In this pa…
Hypergraphs for computing determining sets of Kneser graphs
J. Cáceres, D. Garijo, A. González +2
A set of vertices is a \emph{determining set} of a graph if every automorphism of is uniquely determined by its action on . The \emph{determining number} of is t…