Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Completion and Decomposition of Hypergraphs by Domination Hypergraphs

Autor
Ruiz, J.
Tipus d'activitat
Tesi doctoral
Unitat del programa de doctorat
Facultat de Matemàtiques i Estadística (FME)
Altres unitats relacionades
Departament de Matemàtiques
Data de la defensa
2017-07-18
URL
http://hdl.handle.net/2117/112413 Obrir en finestra nova
Resum
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every vertex not in D is adjacent to some vertex in D. A hypergraph on a finite set X is a collection of subsets of X, none of which is a proper subset of another. The domination hypergraph of a graph is the collection of all the minimal vertex dominating sets of the graph. A hypergraph is a domination hypergraph if it is the ...
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Participants

Arxius