L'objectiu principal de la línia de recerca és l'aplicació de la teoria de grafs i les estructures combinatòries en general al disseny i l?anàlisi de xarxes d'interconnexió. En aquest objectiu hi conflueixen tècniques de teoria de grafs, combinatòria algebraica i enumerativa, optimització combinatòria, algorísmica, estructures aleatòries i geometria discreta. Els temes bàsics de treball són el disseny de topologies per a xarxes d'interconnexió, l'estudi de la seva fiabilitat i vulnerabilitat, algorismes d'encaminament i de difusió de la informació en xarxes, anàlisi de xarxes simètriques i esquemes d'emmagatzemament de dades en arquitectures paral·leles i sistemes informàtics distribuïts.

http://futur.upc.edu/COMBGRAF

The research group has a wide range of interests including Extremal P^roblems in Combinatorics and Graph Theory, Algebraic Graph Theory, Additive Combinatorics, Graph coloring, Graph labelings and decompositions, Combinatorial Geometry, Geomteric and Combinatorial Group Theory or Complex Networks. One of the main applications is focuissed on the study and design of interconnection networks, including characteristic parameters (diameter, connectivity), communication algorithms and large social, biological and data networks.

http://futur.upc.edu/COMBGRAF

The research group has a wide range of interests including Extremal P^roblems in Combinatorics and Graph Theory, Algebraic Graph Theory, Additive Combinatorics, Graph coloring, Graph labelings and decompositions, Combinatorial Geometry, Geomteric and Combinatorial Group Theory or Complex Networks. One of the main applications is focuissed on the study and design of interconnection networks, including characteristic parameters (diameter, connectivity), communication algorithms and large social, biological and data networks.

http://futur.upc.edu/COMBGRAF

Enviaments recents

  • Connected and internal graph searching 

    Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
    Report de recerca
    Accés obert
    This paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ...
  • Confección y gestión automática de exámenes tipo test 

    Cañadas Lorenzo, Juan Carlos; Diego Vives, José Antonio; Pelayo Melero, Ignacio Manuel (Universidad de Cádiz, 2016)
    Comunicació de congrés
    Accés restringit per política de l'editorial
    El presente trabajo describe la implementación de una aplicación informática como recurso docente, diseñada como plataforma para la elaboración, utilización y corrección de controles formativos y exámenes de evaluación. ...
  • 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 ...
  • Algorithmic recognition of infinite cyclic extensions 

    Cavallo, Bren; Delgado Rodríguez, Jordi; Kahrobaei, Delaram; Ventura Capell, Enric (2016-10-25)
    Article
    Accés restringit per política de l'editorial
    We prove that one cannot algorithmically decide whether a finitely presented Z-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show ...
  • Symmetry breaking in tournaments 

    Lozano Bojados, Antoni (2010)
    Report de recerca
    Accés obert
    We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, ...
  • Distance mean-regular graphs 

    Fiol Mora, Miquel Àngel; Diego, Victor (2016)
    Article
    Accés restringit per política de l'editorial
    We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V , diameter D, adjacency matrix A, and ...
  • José Gómez Martí 1968-2014: in memoriam 

    Fiol Mora, Miquel Àngel (Societat Catalana de Matemàtiques (SCM), 2015)
    Article
    Accés obert
  • A note on the order of iterated line digraphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (Wiley, 2016-07-27)
    Article
    Accés restringit per política de l'editorial
    Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices n_k of the k-iterated line digraph L_k(G), for k>= 0, where L_0(G) = G. We obtain this result by using the minimal polynomial ...
  • Deterministic hierarchical networks 

    Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2016)
    Article
    Accés restringit per política de l'editorial
    It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and also scale-free (the degrees are distributed according ...
  • Cospectral digraphs from locally line digraphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (Elsevier, 2016-07-01)
    Article
    Accés restringit per política de l'editorial
    A digraph Gamma = (V, E) is a line digraph when every pair of vertices u, v is an element of V have either equal or disjoint in -neighborhoods. When this condition only applies for vertices in a given subset (with at least ...

Mostra'n més