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

  • Coloración de grafos por vecindades diferentes. 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Alcom, Liliana; Gutierrez, Marisa (2017-07-07)
    Capítol de llibre
    Accés restringit per política de l'editorial
    En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
  • Limited broadcast domination: upper bounds and complexity 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-07-07)
    Capítol de llibre
    Accés restringit per política de l'editorial
    En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
  • Locating domination in bipartites graphs and their complements 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-07-07)
    Capítol de llibre
    Accés restringit per política de l'editorial
    En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
  • On quotient digraphs and voltage digraphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe (2017-10)
    Article
    Accés obert
    We study the relationship between two key concepts in the theory of digraphs, those of quotient digraphs and voltage digraphs. These techniques contract or expand a given digraph in order to study its characteristics,or ...
  • From expanded digraphs to voltage and line digraphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe (2017-10)
    Article
    Accés obert
    In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship between lifted digraphs of voltage digraphs ...
  • The spectra of subKautz and cyclic Kautz digraphs 

    Dalfó Simó, Cristina (Elsevier, 2017-10-15)
    Article
    Accés obert
    Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz CK(d,l) and the subKautz sK(d,2) digraphs were ...
  • From subKautz digraphs to cyclic Kautz digraphs 

    Dalfó Simó, Cristina (2017)
    Report de recerca
    Accés obert
    Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, ...
  • On quotient digraphs and voltage digraphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe (2016)
    Report de recerca
    Accés obert
    In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line ...
  • A new labeling construction from the -product 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (2017-08-01)
    Article
    Accés restringit per política de l'editorial
    The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a ...
  • Locating-dominating partitions in graphs 

    Pelayo Melero, Ignacio Manuel; Hernando Martín, María del Carmen; Mora Giné, Mercè (2016)
    Text en actes de congrés
    Accés obert
    Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ...

Mostra'n més