3 citations · 4 across the 4 of their papers we have counts for
9 papers
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…
Uniform hypergraphs and dominating sets of graphs
Jaume Martí-Farré, Mercè Mora, José Luis Ruiz
A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that th…
New results on metric-locating-dominating sets of graphs
Antonio González, Carmen Hernando, Mercè Mora
A dominating set of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of , and the minimum…
On the Partition Dimension and the Twin Number of a Graph
Carmen Hernando, Merce Mora, Ignacio M Pelayo
A partition P of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of P. The part…
On global location-domination in bipartite graphs
Carmen Hernando, Merce Mora, Ignacio M. Pelayo
A dominating set of a graph is called locating-dominating, LD-set for short, if every vertex not in is uniquely determined by the set of neighbors of belonging…
Perfect and quasiperfect domination in trees
José Cáceres, Carmen Hernando, Mercé Mora +2
A quasiperfect dominating set () of a graph is a vertex subset such that every vertex not in is adjacent to at least one and at most k vertices in . The…