• (1, ≤ ℓ)-identifying codes in digraphs and graphs 

      Martínez Barona, Berenice (Universitat Politècnica de Catalunya, 2020-09-14)
      Tesi
      Accés obert
      The main subject of this PhD thesis is the study of (1,=l)-identifying codes in digraphs. The results presented in this work are divided into three parts. The first one focusses on the structural properties of digraphs ...
    • On the structure of graphs without short cycles 

      Salas Piñón, Julián (Universitat Politècnica de Catalunya, 2012-12-20)
      Tesi
      Accés obert
      The objective of this thesis is to study cages, constructions and properties of such families of graphs. For this, the study of graphs without short cycles plays a fundamental role in order to develop some knowledge on ...
    • Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks 

      Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2000-03-13)
      Tesi
      Accés obert
      Esta tesis trata diversas cuestiones relacionadas con el diseño y estudio de redes de interconexión densas y fiables. Concretamente en ella se han incluido cuatro grupos de contribuciones. En primer lugar se presenta una ...