Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 135 results
  • Access to the full text
    Connectivity: properties and structure  Open access

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2013-12-05
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Connectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, such as Menger¿s theorems. In these theorems, one condition which is clearly necessary also turns out to be sufficient. Moreover, these results are closely related to some other key theorems in graph theory: Ford and Fulkerson¿s theorem about flows and Hall¿s theorem on perfect matchings. With respect to the applications, the study of connectivity parameters of graphs and digraphs is of great interest in the design of reliable and fault-tolerant interconnection or communication networks. Since graph connectivity has been so widely studied, we limit ourselves here to the presentation of some of the key results dealing with finite simple graphs and digraphs. For results about infinite graphs and connectivity algorithms the reader can consult, for instance, Aharoni and Diestel [AhDi94], Gibbons [Gi85], Halin [Ha00], Henzinger, Rao, and Gabow [HeRaGa00], Wigderson [Wi92]. For further details, we refer the reader to some of the good textbooks and surveys available on the subject: Berge [Be76], Bermond, Homobono, and Peyrat [BeHoPe89], Frank [Fr90, Fr94, Fr95], Gross and Yellen [GrYe06], Hellwig and Volkmann [HeVo08], Lov ´asz [Lo93], Mader [Ma79], Oellermann [Oe96], Tutte [Tu66].

    Connectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, such as Menger’s theorems. In these theorems, one condition which is clearly necessary also turns out to be sufficient. Moreover, these results are closely related to some other key theorems in graph theory: Ford and Fulkerson’s theorem about flows and Hall’s theorem on perfect matchings. With respect to the applications, the study of connectivity parameters of graphs and digraphs is of great interest in the design of reliable and fault-tolerant interconnection or communication networks. Since graph connectivity has been so widely studied, we limit ourselves here to the presentation of some of the key results dealing with finite simple graphs and digraphs. For results about infinite graphs and connectivity algorithms the reader can consult, for instance, Aharoni and Diestel [AhDi94], Gibbons [Gi85], Halin [Ha00], Henzinger, Rao, and Gabow [HeRaGa00], Wigderson [Wi92]. For further details, we refer the reader to some of the good textbooks and surveys available on the subject: Berge [Be76], Bermond, Homobono, and Peyrat [BeHoPe89], Frank [Fr90, Fr94, Fr95], Gross and Yellen [GrYe06], Hellwig and Volkmann [HeVo08], Lov ´asz [Lo93], Mader [Ma79], Oellermann [Oe96], Tutte [Tu66].

  • Access to the full text
    Further topics in connectivity  Open access

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2013-12-05
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results concerning maximal (vertex- or edge-) connectivity. Next, we deal with conditions for having (usually lower) bounds for the connectivity parameters. Finally, some other general connectivity measures, such as one instance of the so-called ¿conditional connectivity,¿ are considered. For unexplained terminology concerning connectivity, see §4.1.

    Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results concerning maximal (vertex- or edge-) connectivity. Next, we deal with conditions for having (usually lower) bounds for the connectivity parameters. Finally, some other general connectivity measures, such as one instance of the so-called “conditional connectivity,” are considered. For unexplained terminology concerning connectivity, see §4.1.

  • From clutters to matroids

     Fàbrega Canudas, Josep; Martí Farré, Jaume; Muñoz Lopez, Francisco Javier
    Encuentro Andaluz de Matemática Discreta
    Presentation's date: 2013-10-17
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    This paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion minimal subsets of the family into the set of circuits of a matroid.

    This paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion minimal subsets of the family into the set of circuits of a matroid.

  • Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación

     Aguilo Gost, Francisco de Asis Luis; Abiad Monge, Aida; Andrés Yebra, José Luis; Barriere Figueroa, Eulalia; Cámara Vallejo, Marc; Ball, Simeon Michael; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Garriga Valle, Ernest; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Pérez Mansilla, Sonia; Rius Font, Miquel; Serra Albo, Oriol; Vena, Lluis; Vilaltella Castanyer, Joan; Zaragoza Monroig, Maria Luisa; Espona Dones, Margarida; Sau Valls, Ignasi; Montejano Cantoral, Amanda; Perarnau Llobet, Guillem; Moragas Vilarnau, Jordi; Vena Cros, Lluís; Andres Yebra, Jose Luis; Fiol Mora, Miquel Àngel
    Participation in a competitive project

     Share

  • WORKSHOP ON GRAPH SPECTRA APPLICATIONS IN COMPUTER SCIENCE

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Mitjana Riera, Margarida; Stevanovic, Dragan; Dalfo Simo, Cristina
    Participation in a competitive project

     Share

  • On large (delta, D, D, 1)-graphs

     Gomez Marti, Jose; Fàbrega Canudas, Josep; Andrés Yebra, José Luis
    networks (online)
    Date of publication: 2011-07
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Concern about fault tolerance in the design of interconnection networks has aroused interest in finding large graphs such that the subgraphs obtained by deleting any set of up to s vertices have small diameter. Clearly, 1 ≤ S ≤ Δ− 1, where Δ is the maximum degree of the graph. Graphs of maximum degree Δ, diameter ≤ D and such that the graphs obtained by deletion of up to s vertices have diameter ≤ D' are known as (Δ,D,D',s)-graphs. This article considers the case S = 1 and D = D'. In other words, it deals with the search for large graphs whose diameter does not increase after deleting one vertex. The article also contains an updated table of the largest known (Δ,D,D,1)-graphs, in which most of the entries correspond to the constructions put forward in this article.

  • Edge-distance-regular graphs

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Journal of combinatorial theory. Series A
    Date of publication: 2011
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of Γ, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

  • Access to the full text
    Edge distance-regular graphs  Open access

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Electronic notes in discrete mathematics
    Date of publication: 2011
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of Γ, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

    * distance-regularity; * local spectra; * predistance polynomials; * the spectral excess theorem; * generalized odd graphs

  • Algebraic and combinatoric approach to pseudo-distance-regularity of graphs and completey pseudo-regular codes

     Cámara Vallejo, Marc
    Defense's date: 2011-06-15
    Department of Applied Mathematics IV, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    Edge-distance-regular graphs  Open access

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Date: 2011-03-11
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of Γ, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edgedistance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

  • ALGEBRAIC AND COMBINATORIC APPROACH TO PSEUDO-DISTANCE-REGULARITY OF GRAPHS AND COMPLETELY PSEUDO-REGULAR CODES

     Cámara Vallejo, Marc
    Defense's date: 2011-06-15
    Department of Applied Mathematics IV, Universitat Politècnica de Catalunya
    Theses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Edge-distance-regularity

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    International Workshop on Network Topologies
    Presentation's date: 2011-07-14
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Edge-distance-regular graphs

     Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    European Conference on Combinatorics, Graph Theory and Applications
    Presentation's date: 2011-08-31
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Electronic journal of combinatorics
    Date of publication: 2010-03-08
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    La recerca en matemàtica discreta a Catalunya  Open access

     Fàbrega Canudas, Josep
    Date of publication: 2010-09-08
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Volem presentar en aquest article una visió general de la recerca que es fa a Catalunya en la disciplina coneguda per matemàtica discreta. La relació de temes que podem incloure en aquesta branca de les matemàtiques no està del tot ben precisada i sovint són temes a cavall de diverses matèries de la pròpia matemàtica —com l'àlgebra, la geometria, la teoria de nombres o la teoria de la probabilitat— i d'altres matèries més pròpies de la informàtica teòrica i, fins i tot, de les telecomunicacions. En tot cas, la feina que recollim aquí fa referència als grups de recerca de les universitats catalanes que treballen en combinatòria, teoria de grafs, geometria computacional, criptologia, teoria de codis, algorísmia i teoria de la complexitat. Pel que fa a la distribució per universitats, el gruix més important d’investigadors en l’àrea es concentra a la Universitat Politècnica de Catalunya (UPC), però també trobem grups potents i molt actius a les universitats Autònoma de Barcelona (UAB), Rovira i Virgili (URV), de Lleida (UdL), i també investigadors de la Universitat Pompeu Fabra (UPF). Cal tenir present que les relacions entre els científics de l’àrea són estretes i sovint grups que tenen el centre de gravetat en una determinada universitat compten, entre els seus membres, amb investigadors d’altres universitats.

  • INTERNATIONAL WORKSHOP ON OPTIMAL NETWORK TOPOLOGIES

     Balbuena Martinez, Maria Camino Teofila; Mitjana Riera, Margarida; Serra Albo, Oriol; Fàbrega Canudas, Josep; Comellas Padro, Francesc de Paula
    Participation in a competitive project

     Share

  • A mathematical model for dynamic memory networks  Open access

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Serra Albo, Oriol; Andrés Yebra, José Luis
    International Workshop on Optimal Network Topologies
    Presentation's date: 2010-06-11
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    The aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A dynamic memory is constituted by an array of cells, each storing one datum, and an interconnection network between the cells that allows the constant circulation of the stored data. The objective is to design the interconnection network in order to have short access time and a simple memory control. We review how most of the proposals of dynamic memories that have appeared in the literature fit in this general model, and how it can be used to design new structures with good access properties. Moreover, using the idea of projecting a digraph onto a de Bruijn digraph, we propose new structures for dynamic memories with vectorial capabilities. Some of these new proposals are based on iterated line digraphs, which have been widely and successfully used by M.A. Fiol and his coauthors to solve many different problems in graph theory.

  • Local spectrum of the subconstituents and completely pseudo-regular codes

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Jornadas de Matemática Discreta y Algorítmica
    Presentation's date: 2010-07-08
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Enhancing dynamic student learning by teamwork in innovative projects at an Erasmus Mundus master subject adapted to the EHEA (EEES)

     Lazaro Villa, Jose Antonio; Prat Goma, Josep; Fàbrega Canudas, Josep; Kouloumentas,, Christos
    International Congress of University Teaching and Innovation
    Presentation's date: 2010-06-30
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • COMBINATÒRIA , TEORIA DE GRAFS I APLICACIONS

     Moragas Vilarnau, Jordi; Comellas Padro, Francesc de Paula; López Masip, Susana Clara; Pérez Mansilla, Sonia; Mitjana Riera, Margarida; Llado Sanchez, Anna; Barriere Figueroa, Eulalia; Garriga Valle, Ernest; Muñoz Lopez, Francisco Javier; Zaragoza Monroig, Maria Luisa; Gomez Marti, Jose; Miralles De La Asuncion, Alicia; Espona Dones, Margarida; Rius Font, Miquel; Aroca Farrerons, Josep Maria; Aguilo Gost, Francisco de Asis Luis; Dalfo Simo, Cristina; Cámara Vallejo, Marc; Gago Alvarez, Silvia; Ball, Simeon Michael; Andres Yebra, Jose Luis; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Pelayo Melero, Ignacio Manuel; Serra Albo, Oriol
    Participation in a competitive project

     Share

  • Investigando las matemáticas de las redes de comunicación

     Fàbrega Canudas, Josep; Serra Albo, Oriol
    Date: 2009-07-13
    Report

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • PROBLEMAS EXTREMALES Y DE OPTIMIZACIÓN EN TEORIA DE GRAFOS Y COMBINATORIA: APLICACIÓN AL ANALISIS Y ALGORITMOS DE REDES DE COMUNICAC

     Abiad Monge, Aida; Andres Yebra, Jose Luis; Aguilo Gost, Francisco de Asis Luis; Aroca Farrerons, Josep Maria; Ball, Simeon Michael; Barajas Tomas, Javier; Barguilla Navarrete, Jorge; Barriere Figueroa, Eulalia; Cámara Vallejo, Marc; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Espona Dones, Margarida; Fàbrega Canudas, Josep; Gago Alvarez, Silvia; Garriga Valle, Ernest; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Montejano Cantoral, Amanda; Moragas Vilarnau, Jordi; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Perarnau Llobet, Guillem; Pérez Mansilla, Sonia; Rius Font, Miquel; Sau Valls, Ignasi; Serra Albo, Oriol; Vena, Lluis; Vilaltella Castanyer, Joan; Zaragoza Monroig, Maria Luisa; Vena Cros, Lluís; Fiol Mora, Miquel Àngel
    Participation in a competitive project

     Share

  • Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Electronic journal of combinatorics
    Date of publication: 2009-07
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Graph connectivity: properties, structure and further topics

     Fàbrega Canudas, Josep
    Seminario de Matemática Discreta
    Presentation's date: 2008-09-09
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Algunas aplicaciones de polinomios octogonales de variable discreta a grafos y códigos

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Jornadas de Matemática Discreta y Algorítmica
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Algunas aplicaciones de polinomios ortogonales de variable discreta a grafos y códigos

     Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
    Seminario de Matemática Discreta
    Presentation's date: 2008-09-09
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Edge-connectivity and edge-superconnectivity in sequence graphs

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; García, P
    Discrete applied mathematics
    Date of publication: 2007-10
    Journal article

     Share Reference managers Reference managers Open in new window

  • Combinatòria, Teoria de Grafs i Aplicacions

     Serra Albo, Oriol; Aguilo Gost, Francisco de Asis Luis; Andrés Yebra, José Luis; Balbuena Martinez, Maria Camino Teofila; Ball, Simeon Michael; Barajas Tomas, Javier; Barguilla Navarrete, Jorge; Barriere Figueroa, Eulalia; Comellas Padro, Francesc de Paula; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Gomez Marti, Jose; Llado Sanchez, Anna; López Masip, Susana Clara; Marcote Ordax, Francisco Javier; Miralles De La Asuncion, Alicia; Mitjana Riera, Margarida; Moragas Vilarnau, Jordi; Montejano Cantoral, Amanda; Muñoz Lopez, Francisco Javier; Pelayo Melero, Ignacio Manuel; Pérez Mansilla, Sonia; Rius Font, Miquel; Zaragoza Monroig, Maria Luisa
    Participation in a competitive project

     Share

  • Connectedness of digraphs and graphs under contraints on the conditional diameter

     Marcote Ordax, Francisco Javier; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    networks (online)
    Date of publication: 2005-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • (d,g)-cages with g >= 10 are 4-connected

     Marcote Ordax, Francisco Javier; Pelayo Melero, Ignacio Manuel; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    Discrete mathematics
    Date of publication: 2005-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Further topics in connectivity

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2004-01
    Book chapter

     Share Reference managers Reference managers Open in new window

  • Connectivity : properties and structure

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date of publication: 2004-01
    Book chapter

     Share Reference managers Reference managers Open in new window

  • A Study of network capacity under deflection routing schemes

     Fàbrega Canudas, Josep; Muñoz Lopez, Francisco Javier
    Lecture notes in computer science
    Date of publication: 2003-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • Graph Connectivity: Properties and Structure. Codi Biblioteca 1400132574

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date: 2003-04
    Report

     Share Reference managers Reference managers Open in new window

  • Graph Connectivity: Further Topics

     Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel
    Date: 2003-04
    Report

     Share Reference managers Reference managers Open in new window

  • A Study of network capacity under deflection routing schemes

     Fàbrega Canudas, Josep; Muñoz Lopez, Francisco Javier
    Euro-Par
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A Study of network capacity under deflection routing schemes

     Fàbrega Canudas, Josep
    Euro-Par
    Presentation's date: 2003-08-26
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Some contributions to the study of the connectedness of Graphs and Digraphs.

     Marcote Ordax, Francisco Javier
    Defense's date: 2003-04-10
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Using a progressive withdrawal procedure to study superconnectivity in digraphs

     Pelayo Melero, Ignacio Manuel; Marcote Ordax, Francisco Javier; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    Discrete mathematics
    Date of publication: 2003-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • Matemática discreta

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Llado Sanchez, Anna; Lladí, A S; Serra Albo, Oriol
    Date of publication: 2002-07-31
    Book

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • (d, g)-cages with g >= 10 are 4-connected

     Marcote Ordax, Francisco Javier; Pelayo Melero, Ignacio Manuel; Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep
    Combinatorics'2002
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • How to find the maximum admissible throughput in deflection routing networks

     Fàbrega Canudas, Josep; Muñoz Lopez, Francisco Javier
    Date: 2002-07
    Report

     Share Reference managers Reference managers Open in new window

  • Superconnected digraphs and graphs with small conditional diameters

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Marcote Ordax, Francisco Javier; Pelayo Melero, Ignacio Manuel
    networks (online)
    Date of publication: 2002-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • Matemática discreta

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Llado Sanchez, Anna; Serra Albo, Oriol
    Date of publication: 2001-03-31
    Book

     Share Reference managers Reference managers Open in new window

  • Transporte y gestión de la información en sistema distribuidos: Modelización de redes y diseño de algoritmos

     Gomez Marti, Jose; Fàbrega Canudas, Josep; Mitjana Riera, Margarida; Maureso Sanchez, Montserrat; Fiol Mora, Miquel Àngel; Pelayo Melero, Ignacio Manuel
    Participation in a competitive project

     Share

  • Transporte y gestión de la información en sistemas distribuidos. Modelización de redes y diseño de algoritmos (Ref.: TIC2001-2171)

     Balbuena Martinez, Maria Camino Teofila; Fàbrega Canudas, Josep; Marcote Ordax, Francisco Javier; Ozon Gorriz, Francisco Javier
    Participation in a competitive project

     Share

  • Preface

     Comellas Padro, Francesc de Paula; Fàbrega Canudas, Josep; Fraigniaud, P
    8th International Colloquium on Structural Information and Communication Complexity
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Edge bisection width of chordal rings

     Barriere Figueroa, Eulalia; Fàbrega Canudas, Josep
    Lecture notes in computer science
    Date of publication: 2000-08
    Journal article

     Share Reference managers Reference managers Open in new window