Now showing items 1-6 of 6

• #### Completion and decomposition of hypergraphs by domination hypergraphs ﻿

(Universitat Politècnica de Catalunya, 2017-07-18)
Doctoral thesis
Open Access
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 ...
• #### Completion and decomposition of hypergraphs into dominating sets of graphs ﻿

(2015-11)
Article
Open Access
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. ...
• #### Elimination properties for minimal dominating sets of graphs ﻿

(2020-01-01)
Article
Open Access
A dominating set of a graph is a vertex subset such that every vertexnot in the subset is adjacent to at least one in the subset. In this paper westudy whenever there exists a new dominating set contained (respectively, ...
• #### Transmission and Coding of Information ﻿

(Universitat Politècnica de Catalunya, 2018)
Lecture notes
Open Access
• #### Transmission and coding of information - problem list ﻿

(Universitat Politècnica de Catalunya, 2018)
Problem statement, exercise
Open Access
• #### Uniform clutters and dominating sets of graphs ﻿

(2019-06-30)
Article
Open Access
A (simple) clutter is a family of pairwise incomparable subsets of a finite set . We say that a clutter is a domination clutter if there is at least a graph such that the collection of the inclusion-minimal dominating sets ...