3 citations · 4 across the 4 of their papers we have counts for
3 papers · 1 filter
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…