Ara es mostren els items 1-17 de 17

  • Algunos grafos compuestos 

    Fiol Mora, Miquel Àngel; Fàbrega Canudas, José (Universidad de Barcelona, Departamento de Estadística Matemática;Universidad Politécnica de Barcelona, Escuela Técnica Superior de Arquitectura, Departamento de Matemáticas y Estadística, 1983)
    Article
    Accés obert
    From two graphs $G_1$ and $G_2$ on $N_1$ and $N_2$ vertices respectively, the compound graph $G_1[G_2]$ on $N_1N_2$ vertices is obtained connecting $N_2$ copies of $G_1$ following the structure of $G_2$. We present in ...
  • A mathematical model for dynamic memory networks 

    Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Serra Albó, Oriol; Andrés Yebra, José Luis (Iniciativa Digital Politècnica, 2011)
    Text en actes de congrés
    Accés obert
    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 ...
  • Combinatorial vs. algebraic characterizations of pseudo-distance-regularity around a set 

    Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2009-06)
    Report de recerca
    Accés obert
    Given a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regularity around $C$ generalizes, for not necessarily regular graphs, the notion of completely regular code. Up to now, most ...
  • Connectivity: properties and structure 

    Balbuena Martínez, Maria Camino Teófila; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel (CRC Press Taylor & Francis Group, 2013-12-05)
    Capítol de llibre
    Accés obert
    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, ...
  • Digraphs with walks of equal length between vertices 

    Fiol Mora, Miquel Àngel; Alegre, Ignasi; Andrés Yebra, José Luís; Fàbrega Canudas, José (1984)
    Text en actes de congrés
    Accés obert
  • Edge distance-regular graphs 

    Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011)
    Article
    Accés obert
    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 ...
  • Edge-distance-regular graphs 

    Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011)
    Article
    Accés restringit per política de l'editorial
    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 ...
  • Edge-distance-regular graphs 

    Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011-03-11)
    Report de recerca
    Accés obert
    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 ...
  • Enhancing dynamic student learning by teamwork in innovative projects at an Erasmus Mundus master subject adapted to the EHEA (EEES) 

    Lázaro Villa, José Antonio; Prat Gomà, Josep Joan; Fàbrega Canudas, José; Kouloumentas,, Christos (Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació (ICE), 2010)
    Text en actes de congrés
    Accés obert
    The EHEA (EEES in Spain) is creating common academic degree standards comparable and compatible between the European countries. The definition of the new Credit unit, the ECTS, focused on the ...
  • From clutters to matroids 

    Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (Universidad de Sevilla, 2013)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    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 ...
  • Further topics in connectivity 

    Balbuena Martínez, Maria Camino Teófila; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel (CRC Press Taylor & Francis Group, 2013-12-05)
    Capítol de llibre
    Accés obert
    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 ...
  • La recerca en matemàtica discreta a Catalunya 

    Fàbrega Canudas, José (Institut d'Estudis Catalans (IEC), 2010-09-08)
    Capítol de llibre
    Accés obert
    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 ...
  • Layer structure of De Bruijn and Kautz digraphs: an application to deflection routing 

    Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (2016-10-17)
    Article
    Accés restringit per política de l'editorial
    In the main part of this paper we present polynomial expressions for the cardinalities of some sets of interest of the nice distance-layer structure of the well-known De Bruijn and Kautz digraphs. More precisely, given a ...
  • On large (delta, D, D, 1)-graphs 

    Gómez Martí, José; Fàbrega Canudas, José; Andrés Yebra, José Luis (2011-07)
    Article
    Accés restringit per política de l'editorial
    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 ...
  • On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes 

    Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2014-10-30)
    Article
    Accés restringit per política de l'editorial
    In this paper we study the relation between the local spectrum of a vertex set C and the local spectra of its subconstituents. In particular, it is shown that, when C is a completely regular code, such spectra are uniquely ...
  • Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes 

    Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Fàbrega Canudas, José; Cámara Vallejo, Marc (2000-08)
    Article
    Accés obert
    We present some related families of orthogonal polynomials of a discrete variable and survey some of their applications in the study of (distance-regular) graphs and (completely regular) codes. One of the main peculiarities ...
  • The design and control of dynamic memory networks 

    Fiol Mora, Miquel Àngel; Fàbrega Canudas, José; Yebra, José Luis A. (IEEE Press, 1988)
    Text en actes de congrés
    Accés obert
    A dynamic memory is a storage medium constituted by an array of cells and an interconnection network between them. It is characterized by the constant circulation of the stored data. The concern is to design the interconnection ...