Now showing items 1-20 of 68

    • 1-Markov chains: Basic concepts 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-07-08)
      Other
      Open Access
    • 2-Markov chains: Absorbing Markov chains 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-07-08)
      Other
      Open Access
    • 3-Markov chains: Stationary distributions 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-07-08)
      Other
      Open Access
    • 4-Markov chains: Limiting distributions 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-07-08)
      Other
      Open Access
    • 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)
      Conference report
      Open Access
      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 ...
    • 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
      Open Access
      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 ...
    • Basic notions on random processes 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-03-19)
      Other
      Open Access
    • 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)
      Research report
      Open Access
      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)
      Part of book or chapter of book
      Open Access
      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)
      Conference report
      Open Access
    • Edge distance-regular graphs 

      Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011)
      Article
      Open Access
      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
      Restricted access - publisher's policy
      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)
      Research report
      Open Access
      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)
      Conference report
      Open Access
      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 ...
    • Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity 

      Fiol Mora, Miquel Àngel; Fàbrega Canudas, José; Diego Gutiérrez, Víctor (2020-09)
      Article
      Open Access
      The spectrum of a graph usually provides a lot of information about its combinatorial structure. Moreover,from the spectrum, the so-called predistance polynomials can be defined, as a generalization, for any graph, of the ...
    • From clutters to matroids 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (Universidad de Sevilla, 2013)
      Conference report
      Restricted access - publisher's policy
      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)
      Part of book or chapter of book
      Open Access
      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 ...
    • Gaussian random vectors 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-02-25)
      Other
      Open Access
    • Generating and characteristic functions 

      Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 2022-02-04)
      Other
      Open Access
    • La recerca en matemàtica discreta a Catalunya 

      Fàbrega Canudas, José (Institut d'Estudis Catalans (IEC), 2010-09-08)
      Part of book or chapter of book
      Open Access
      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 ...