473 citations · 514 across the 23 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Locating domination in bipartite graphs and their complements
Carmen Hernando, Mercè Mora, Ignacio M. Pelayo
A set of vertices of a graph is \emph{distinguishing} if the sets of neighbors in for every pair of vertices not in are distinct. A \emph{locating-dominating set} o…
math.CO2017
Resolving dominating partitions in graphs
Carmen Hernando, Mercè Mora, Ignacio M. Pelayo
A partition of the vertex set of a connected graph is called a \emph{resolving partition} of if for every pair of vertices and , $d(u,S_j)\neq…
math.CO2017
Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
José Cáceres, Carmen Hernando, Mercè Mora +2
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider…