Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Uniform hypergraphs and dominating sets of graphs

Autor
Martí-Farré, J.; Mora, M.; Ruiz, J.
Tipus d'activitat
Document cientificotècnic
Data
2016-05-05
URL
https://arxiv.org/abs/1605.01578 Obrir en finestra nova
Resum
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 the collection of minimal dominating sets of G is equal to H. Given a hypergraph, we are interested in determining if it is a domination hypergraph and, if this is not the case, we want to find domination hypergraphs in some sense close to it, the domination completions. Here we will focus on the family of hypergraphs co...
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Participants