473 citations · 572 across the 27 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
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.CO2012★ 49 cited
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…