Browsing by Author "Fàbrega Canudas, José"
Now showing items 120 of 34

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 AccessThe 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 AccessFrom 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 ... 
Combinatorial vs. algebraic characterizations of pseudodistanceregularity around a set
Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (200906)
External research report
Open AccessGiven a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudodistanceregularity 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, 20131205)
Part of book or chapter of book
Open AccessConnectivity 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 maxmin 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 distanceregular graphs
Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011)
Article
Open AccessEdgedistanceregularity is a concept recently introduced by the authors which is similar to that of distanceregularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ... 
Edgedistanceregular 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 policyEdgedistanceregularity is a concept recently introduced by the authors which is similar to that of distanceregularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ... 
Edgedistanceregular graphs
Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (20110311)
External research report
Open AccessEdgedistanceregularity is a concept recently introduced by the authors which is similar to that of distanceregularity, 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 AccessThe 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 distanceregularity
Fiol Mora, Miquel Àngel; Fàbrega Canudas, José; Diego Gutiérrez, Víctor (202009)
Article
Open AccessThe spectrum of a graph usually provides a lot of information about its combinatorial structure. Moreover,from the spectrum, the socalled 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 policyThis 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, 20131205)
Part of book or chapter of book
Open AccessContinuing 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 edgeconnectivity. First, we describe results ... 
La recerca en matemàtica discreta a Catalunya
Fàbrega Canudas, José (Institut d'Estudis Catalans (IEC), 20100908)
Part of book or chapter of book
Open AccessVolem 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 (20161017)
Article
Open AccessIn the main part of this paper we present polynomial expressions for the cardinalities of some sets of interest of the nice distancelayer structure of the wellknown 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 (201107)
Article
Restricted access  publisher's policyConcern 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 pseudoregular codes
Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (20141030)
Article
Restricted access  publisher's policyIn 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 ... 
Online matching in regular bipartite graphs with randomized adversary
Fàbrega Canudas, José; Muñoz López, Francisco Javier (Springer, 201808)
Part of book or chapter of book
Restricted access  publisher's policy 
PROBABILITAT I PROCESSOS ESTOCÀSTICS
Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 20130115)
Exam
Restricted access to the UPC academic community 
PROBABILITAT I PROCESSOS ESTOCÀSTICS
Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 20120627)
Exam
Restricted access to the UPC academic community 
PROBABILITAT I PROCESSOS ESTOCÀSTICS
Fàbrega Canudas, José (Universitat Politècnica de Catalunya, 20111026)
Exam
Restricted access to the UPC academic community