Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Completion and decomposition of hypergraphs into dominating sets of graphs

Autor
Martí-Farré, J.; Mora, M.; Ruiz, J.L.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2015-11
Volum
49
Pàgina inicial
213
Pàgina final
220
DOI
https://doi.org/10.1016/j.endm.2015.06.031 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/81940 Obrir en finestra nova
Resum
The collection of the vertex dominating sets of a graph defines a hypergraph on the set of vertices of the graph. However, there are hypergraphs H that are not the collection of the vertex dominating sets of any graph. This paper deals with the question of completing these hypergraphs H to the vertex dominating sets of some graphs G. We demonstrate that such graphs G exist and, in addition, we prove that these graphs define a poset whose minimal elements provide a decomposition of H. Moreover, w...
Citació
Martí-Farré, J., Mora, M., Ruiz, J. Completion and decomposition of hypergraphs into dominating sets of graphs. "Electronic notes in discrete mathematics", Novembre 2015, vol. 49, p. 213-220.
Paraules clau
Graph, dominating set, hypergraph
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants

Arxius