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

  • 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 ...
  • Conjugacy in houghton's groups 

    Antolin, Yago; Burillo Puig, José; Martino, Armando (2015)
    Article
    Open Access
    Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually act as a translation in each copy of N. We prove the solvability of the conjugacy problem and conjugator search problem for ...
  • Lissajous curves: an experiment in creative coding 

    Barrière Figueroa, Eulalia (2015)
    Conference lecture
    Restricted access - publisher's policy
    Do you want to become a creative coder for a day? When artists use a computer to make art, they often experience the need of improving their mathematical skills. On the other hand, students with technical skills are less ...
  • Proyecto, desarrollo y valoración en la UPC de un caso de feedforwarding en campus virtual 

    Fabregat Fillet, Jaume; Pelayo Melero, Ignacio Manuel; Valero Baya, Jordi; Ornat Longarón, Cèsar; Achaerandio Puente, María Isabel; Pineda Soler, Eloi; Buenestado Caballero, Pablo (Universitat Politècnica de València, 2015)
    Conference report
    Open Access
    Docentes de UPC, UB, UAB, UIB, UOC y URV investigamos sobre una evaluación formativa "feedforwarding", que realimente de inmediato, que no se limite al "correcto-incorrecto", que guíe más que resuelva, que sea suficientemente ...
  • The diameter of cyclic Kautz digraphs 

    Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens (2015-11-12)
    Article
    Restricted access - publisher's policy
    A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given ...
  • On middle cube graphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida (2015)
    Article
    Open Access
    We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The ...

View more