Completion and decomposition of hypergraphs by domination hypergraphs 

Ruiz Muñoz, José Luis (Date of defense: 2017-07-18)

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 ...