2 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2014★ 2 cited
On Perfect and Quasiperfect Domination in Graphs
José Cáceres, Carmen Hernando, Mercè Mora +2
A subset in a graph is a -quasiperfect dominating set (for ) if every vertex not in is adjacent to at least one and at most vertices in…
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…