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

  • 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), . . . ...
  • The number and degree distribution of spanning trees in the Tower of Hanoi graph 

    Zhang, Zhongzhi; Wu, Shunqi; Li, Mingyun; Comellas Padró, Francesc de Paula (2016-01-04)
    Article
    Accés restringit per política de l'editorial
    The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical ...
  • On the spectra of Markov matrices for weighted Sierpinski graphs 

    Comellas Padró, Francesc de Paula; Xie, Pinchen; Zhang, Zhongzhi (2016)
    Text en actes de congrés
    Accés obert
    Relevant information from networked systems can be obtained by analyzing the spectra of matrices associated to their graph representations. In particular, the eigenvalues and eigenvectors of the Markov matrix and related ...
  • Iterated line digraphs are asymptotically dense 

    Dalfó Simó, Cristina (Elsevier, 2017)
    Article
    Accés obert
    We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymptotically large order for a given diameter (or with small diameter for a given order). This is a well- known result for ...
  • The normalized Laplacian spectrum of subdivisions of a graph 

    Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula (2016-08-05)
    Article
    Accés restringit per política de l'editorial
    Determining and analyzing the spectra of graphs is an important and exciting research topic in mathematics science and theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information ...
  • On perfect and quasiperfect dominations in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-02-27)
    Article
    Accés obert
    A subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k -quasiperfect ...
  • Perfect (super) Edge-Magic Crowns 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni; Prabu, M. (2017-01-06)
    Article
    Accés restringit per política de l'editorial
    A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is ...
  • General properties of c-circulant digraphs 

    Mora Giné, Mercè; Serra Albó, Oriol; Fiol Mora, Miquel Àngel (1988)
    Article
    Accés obert
    A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation ...
  • Online graph coloring with advice and randomized adversary 

    Muñoz López, Francisco Javier (Springer, 2016)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    We generalize the model of online computation with three players (algorithm, adversary and an oracle called advisor) by strength- ening the power of the adversary by randomization. In our generalized model, the advisor ...

Mostra'n més