473 citations · 531 across the 7 of their papers we have counts for
8 papers
General bounds on limited broadcast domination
José Cáceres, Carmen Hernando, Mercè Mora +2
Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as…
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…
On independent -sets in trees
Sahar Aleid, Jose Caceres, Maria Luz Puertas
An independent -set in a graph is a dominating set which is independent and such that every vertex not in has at most neighbors in it. The existence of such…
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…
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…
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…