Now showing items 1-20 of 34

• #### A mathematical model for dynamic memory networks ﻿

(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 ﻿

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 ...
• #### Combinatorial vs. algebraic characterizations of pseudo-distance-regularity around a set ﻿

(2009-06)
External 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 ﻿

(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 ﻿

(1984)
Conference report
Open Access
• #### Edge distance-regular graphs ﻿

(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 ﻿

(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 ﻿

(2011-03-11)
External 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) ﻿

(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 ﻿

(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 ﻿

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 ﻿

(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 ...
• #### La recerca en matemàtica discreta a Catalunya ﻿

(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 ...
• #### Layer structure of De Bruijn and Kautz digraphs: an application to deflection routing ﻿

(2016-10-17)
Article
Open Access
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 ﻿

(2011-07)
Article
Restricted access - publisher's policy
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 ﻿

(2014-10-30)
Article
Restricted access - publisher's policy
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 ...
• #### Online matching in regular bipartite graphs with randomized adversary ﻿

(Springer, 2018-08)
Part of book or chapter of book
Restricted access - publisher's policy
• #### PROBABILITAT I PROCESSOS ESTOCÀSTICS ﻿

(Universitat Politècnica de Catalunya, 2013-01-15)
Exam