Exploració per tema "Graph"

Ara es mostren els items 1-20 de 35

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

    • A differential approach for bounding the index of graphs under perturbations 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011-03)
      Report de recerca
      Accés obert

    • A new class of polynomials from the spectrum of a graph, and its application to bound the k-independence number 

      Fiol Mora, Miquel Àngel (Elsevier, 2020-11-15)
      Article
      Accés obert
      The k-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than k. A graph is called k-partially walk-regular if the number of closed walks of a given length l = k, rooted ...

    • Analysis and solution of a collection of algorithmic problems 

      López Martínez, Rafael Eusebio (Universitat Politècnica de Catalunya, 2018-01)
      Treball Final de Grau
      Accés obert
      In competitive programming, one has to use knowledge in algorithms and data structures to find solutions to algorithmic problems, then put those a ideas into a correct computer program that solves the problem within given ...

    • Building graph representations of deep vector embeddings 

      Garcia Gasulla, Dario; Vilalta Arias, Armand; Parés Pont, Ferran; Moreno Vázquez, Jonatan; Ayguadé Parra, Eduard; Labarta Mancho, Jesús José; Cortés García, Claudio Ulises; Suzumura, Toyotaro (Association for Computational Linguistics, 2017)
      Comunicació de congrés
      Accés obert
      Patterns stored within pre-trained deep neural networks compose large and powerful descriptive languages that can be used for many different purposes. Typically, deep network representations are implemented within vector ...

    • c-Critical graphs with maximum degree three 

      Fiol Mora, Miquel Àngel (John Wiley and Sons, Inc., 1995)
      Capítol de llibre
      Accés restringit per política de l'editorial
      Let $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident ...

    • Characterizing identifying codes from the spectrum of a graph or digraph 

      Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (Elsevier, 2019-06-01)
      Article
      Accés obert
      A -identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most l have distinct closed in-neighborhoods within C. As far as we know, it ...

    • Characterizing identifying codes through the spectrum of a graph or digraph 

      Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (2017)
      Text en actes de congrés
      Accés obert

    • Communication indices of hierarchical product of trees 

      Girón Albert, Cecilia (Universitat Politècnica de Catalunya, 2014-10)
      Projecte Final de Màster Oficial
      Accés restringit per decisió de l'autor
      In this master's thesis we study different graph indices for two families of hierarchical trees. We recall first the construction of these graphs by using the hierarchical product of graphs on paths and stars. We name the ...

    • Completion and decomposition of hypergraphs into dominating sets of graphs 

      Martí Farré, Jaume; Mora Giné, Mercè; Ruiz Muñoz, José Luis (2015-11)
      Article
      Accés obert
      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. ...

    • Controllability of leader-following multi-agent systems 

      García Planas, María Isabel (WSEAS Press, 2023-01-01)
      Article
      Accés obert
      In this work, the controllability of a class of multi-agent linear systems that are interconnected via communication channels is studied. Condition for controllability have been presented and described in terms of the ...

    • Cospectral mates for generalized Johnson and Grassmann graphs 

      Abiad Monge, Aida; D'haeseleer, Jozefien; Haemers, Willem H.; Simoens, Robin Nicolas (Elsevier, 2023-12)
      Article
      Accés obert
      We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.

    • Eina d'analítiques per a l'automatizació de processos 

      Salvadó I Gómez, Guillem (Universitat Politècnica de Catalunya, 2019-07)
      Treball Final de Grau
      Accés restringit per acord de confidencialitat

    • Eina per a l'elaboració automàtica d'anàlisis sociomètrics en entorns escolars 

      Ramon Ros, Martí (Universitat Politècnica de Catalunya, 2021-10-25)
      Treball Final de Grau
      Accés obert

    • Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity 

      Fiol Mora, Miquel Àngel; Fàbrega Canudas, José; Diego Gutiérrez, Víctor (2020-09)
      Article
      Accés obert
      The spectrum of a graph usually provides a lot of information about its combinatorial structure. Moreover,from the spectrum, the so-called predistance polynomials can be defined, as a generalization, for any graph, of the ...

    • General bounds on limited broadcast domination 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
      Report de recerca
      Accés obert
      Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...

    • Graphs attaining the upper bound on the isolation number 

      Lemanska, Magdalena; Mora Giné, Mercè; Souto Salorio, María josé (Universidad de Cádiz, 2023)
      Text en actes de congrés
      Accés obert
      A set D of vertices of a graph is isolating if the set of vertices not belonging to D or not having a neighbour in D is independent. The isolation number of a graph G, denoted by ¿(G), is the minimum cardinality of an ...

    • Graphs, Friends and Acquaintances 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2010-04-23)
      Report de recerca
      Accés obert
      As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs ...

    • Identification of spatial communities in the human genome graph to better understand HIV latency and insertion 

      García Gutiérrez, Ricardo (Universitat Politècnica de Catalunya, 2019-06-24)
      Projecte Final de Màster Oficial
      Accés obert
      In this work, the 3D spatial organization of a human Jurkat cell, an immune cell who is one ofthe main targets of the human immunodeficiency virus (HIV), is analyzed through the clusteringof genome interactions networks ...

    • On the metric representation of the vertices of a graph 

      Mora Giné, Mercè; Puertas González, María Luz (2023-09-12)
      Article
      Accés restringit per política de l'editorial
      The metric representation of a vertex u in a connected graph G respect to an ordered vertex subset is the vector of distances . A vertex subset W is a resolving set of G if , for every with . Thus, a resolving set with n ...