473 citations · 514 across the 23 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Nordhaus-Gaddum bounds for locating domination
C. Hernando, M. Mora, I. M. Pelayo
A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the verti…
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…