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

  • (Di)graph products, labelings and related results 

    López Masip, Susana Clara (2017-07)
    Article
    Accés restringit per política de l'editorial
    Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can ...
  • On subsets of the normal rational curve 

    Ball, Simeon Michael; De Beule, Jan (2017-06-01)
    Article
    Accés restringit per política de l'editorial
    A normal rational curve of the (k-1) -dimensional projective space over Fq is an arc of size q+1 , since any k points of the curve span the whole space. In this paper, we will prove that if q is odd, then a subset of size ...
  • Counting configuration-free sets in groups 

    Rué Perna, Juan José; Serra Albó, Oriol; Vena Cros, Lluís (2017-01-01)
    Article
    Accés restringit per política de l'editorial
    © 2017 Elsevier Ltd. We provide asymptotic counting for the number of subsets of given size which are free of certain configurations in finite groups. Applications include sets without solutions to equations in non-abelian ...
  • Characterizing path-like trees from linear configurations 

    López Masip, Susana Clara (2017)
    Comunicació de congrés
    Accés obert
    Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, ...
  • Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree 

    Cano Vila, María del Pilar; Perarnau Llobet, Guillem; Serra Albó, Oriol (2017-08-01)
    Article
    Accés restringit per política de l'editorial
    We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of ...
  • On sets defining few ordinary planes 

    Ball, Simeon Michael (2017-09-19)
    Article
    Accés restringit per política de l'editorial
    Let S be a set of n points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of S is less than (Formula presented.) for some ...
  • Locating domination in bipartite graphs and their complements 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
    Report de recerca
    Accés obert
    A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...
  • Metric-locating-dominating partitions in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
    Report de recerca
    Accés obert
    A partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metric-locating partition of G if for every pair of vertices u,v belonging to the same part S i , d ( u,S j ) 6 = d ( v,S j ), for some other ...
  • Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-10-16)
    Report de recerca
    Accés obert
    Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
  • A generalisation of Sylvester's problem to higher dimensions 

    Ball, Simeon Michael; Monserrat, Joaquim (2017-07-01)
    Article
    Accés obert
    In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ points of $S$ span a hyperplane and not all the points of $S$ are contained in a hyperplane. The aim of this article is to ...
  • A finite version of the Kakeya problem 

    Ball, Simeon Michael; Blokhuis, Aart; Domenzain, Diego (2016-06-02)
    Article
    Accés obert
    Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines ...
  • 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

Mostra'n més