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

Recent Submissions

  • José Gómez Martí 1968-2014: in memoriam 

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

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (Wiley, 2016-07-27)
    Article
    Restricted access - publisher's policy
    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
    Restricted access - publisher's policy
    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
    Restricted access - publisher's policy
    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 ...
  • The degree/diameter problem in maximal planar bipartite graphs 

    Dalfó Simó, Cristina; Huemer, Clemens; Salas Piñon, Julián (2016)
    Article
    Open Access
    The (Δ,D)(Δ,D) (degree/diameter) problem consists of finding the largest possible number of vertices nn among all the graphs with maximum degree ΔΔ and diameter DD. We consider the (Δ,D)(Δ,D) problem for maximal planar ...
  • On the Partition Dimension and the Twin Number of a Graph 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2016-03-05)
    External research report
    Open Access
    A partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum ...
  • Perfect and quasiperfect domination in trees 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz (2016-04-25)
    Article
    Open Access
    A k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k-quasip erfect dominating ...
  • Counting configuration–free sets in groups 

    Rué Perna, Juan José; Serra Albó, Oriol; Vena Cros, Lluís (2015)
    Conference lecture
    Restricted access - publisher's policy
    We present a unified framework to asymptotically count the number of sets, with a given cardinality, free of certain configurations. This is done by combining the hypergraph containers methodology joint with arithmetic ...
  • On sets of vectors of a finite vector space in which every subset of basis size is a basis II 

    Ball, Simeon Michael; De Beule, Jan (2012-10)
    Article
    Open Access
    This article contains a proof of the MDS conjecture for k = 2p - 2. That is, that if S is a set of vectors of F k q in which every subset of S of size k is a basis, where q = p h, p is prime and q is not and k = 2p - 2, ...
  • Langford sequences and a product of digraphs 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2015-12-07)
    Article
    Restricted access - publisher's policy
    Skolem and Langford sequences and their many generalizations have applications in numerous areas. The ¿h-product is a generalization of the direct product of digraphs. In this paper we use the ¿h-product and super edge-magic ...

View more