 Department
 Department of Applied Mathematics IV
 egarrigama4.upc.edu
 Contact details
 UPC directory
Scientific and technological production


Moments in graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Discrete applied mathematics
Date of publication: 2013
Journal article
Read the abstract Access to the full text Share Reference managersThis parameter generalizes, or it is closely related to, some wellknown graph invariants, such as the Wiener index W (G), when rho(u) = 1/2 for every u is an element of V, and the degree distance D'(G), obtained when rho(u) = delta(u), the degree of vertex u. In this paper we derive some exact formulas for computing the rhomoment of a graph obtained by a general operation called graft product, which can be seen as a generalization of the hierarchical product, in terms of the corresponding rhomoments of its factors. As a consequence, we provide a method for obtaining nonisomorphic graphs with the same rhomoment for every rho (and hence with equal mean distance, Wiener index, degree distance, etc.). In the case when the factors are trees and/or cycles, techniques from linear algebra allow us to give formulas for the degree distance of their product.
Let G be a connected graph with vertex set V and a weight function that assigns a nonnegative number to each of its vertices. Then, the moment of G at vertex u is de ned to be M G(u) = P v2V (v) dist(u; v), where dist( ; ) stands for the distance function. Adding up all these numbers, we obtain the moment of G: This parameter generalizes, or it is closely related to, some wellknown graph invari ants, such as the Wiener index W(G), when (u) = 1=2 for every u 2 V , and the degree distance D0(G), obtained when (u) = (u), the degree of vertex u. In this paper we derive some exact formulas for computing the moment of a graph obtained by a general operation called graft product, which can be seen as a generalization of the hierarchical product, in terms of the corresponding moments of its factors. As a consequence, we provide a method for obtaining nonisomorphic graphs with the same moment for every (and hence with equal mean distance, Wiener index, degree distance, etc.). In the case when the factors are trees and/or cycles, techniques from linear algebra allow us to give formulas for the degree distance of their product.
Postprint (author’s final draft) 
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 
Dual concepts of almost distanceregularity and the spectral excess theorem
Dalfo Simo, Cristina; Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Discrete mathematics
Date of publication: 2011
Journal article
View Share Reference managers 
A differential approach for bounding the index of graphs under perturbations
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Electronic journal of combinatorics
Date of publication: 20110902
Journal article
Read the abstract Access to the full text Share Reference managersThis paper presents bounds for the variation of the spectral radius (G) of a graph G after some perturbations or local vertex/edge modifications of G. The perturbations considered here are the connection of a new vertex with, say, g vertices of G, the addition of a pendant edge (the previous case with g = 1) and the addition of an edge. The method proposed here is based on continuous perturbations and the study of their differential inequalities associated. Within rather economical information (namely, the degrees of the vertices involved in the perturbation), the best possible inequalities are obtained. In addition, the cases when equalities are attained are characterized. The asymptotic behavior of the bounds obtained is also discussed. 
Edge distanceregular graphs
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 Access to the full text Share Reference managersEdgedistanceregularity 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 graph Γ with adjacency matrix A is edgedistanceregular when it is distanceregular 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 edgedistanceregular if and only if its kincidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distanceregular graphs is proved, so giving a quasispectral characterization of edgedistanceregularity. Finally, it is shown that every nonbipartite graph which is both distanceregular and edgedistanceregular is a generalized odd graph.
* distanceregularity; * local spectra; * predistance polynomials; * the spectral excess theorem; * generalized odd graphs 
Edgedistanceregular 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 View Share Reference managersEdgedistanceregularity 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 graph Γ with adjacency matrix A is edgedistanceregular when it is distanceregular 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 edgedistanceregular if and only if its kincidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distanceregular graphs is proved, so giving a quasispectral characterization of edgedistanceregularity. Finally, it is shown that every nonbipartite graph which is both distanceregular and edgedistanceregular is a generalized odd graph. 
A differential approach for bounding the index of graphs under perturbations
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Date: 201103
Report
Access to the full text Share Reference managers 
Edgedistanceregular graphs
Cámara Vallejo, Marc; Dalfo Simo, Cristina; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Date: 20110311
Report
Read the abstract Access to the full text Share Reference managersEdgedistanceregularity 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 graph Γ with adjacency matrix A is edgedistanceregular when it is distanceregular 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 edgedistanceregular if and only if its kincidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distanceregular graphs is proved, so giving a quasispectral characterization of edgedistanceregularity. Finally, it is shown that every nonbipartite graph which is both distanceregular and edgedistanceregular is a generalized odd graph. 
Edgedistanceregularity
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: 20110714
Presentation of work at congresses
Share Reference managers 
A new differencial approach to bound the spectral radius of graphs under perturbations
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Slovenian International Conference on Graph Theory
Presentation's date: 20110621
Presentation of work at congresses
View Share Reference managers 
Edgedistanceregular 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: 20110831
Presentation of work at congresses
Share Reference managers 
On almost distanceregular graphs
Dalfo Simo, Cristina; Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Gorissen, Bram
Journal of combinatorial theory. Series A
Date of publication: 2010
Journal article
Read the abstract View Share Reference managersDistanceregular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distanceregular graphs, we study ‘almost distanceregular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the graph. For example, a known characterization of a distanceregular graph is the invariance of the number of walks of given length between vertices at a given distance, while a graph is called walkregular if the number of closed walks of given length rooted at any given vertex is a constant. One of the concepts studied here is a generalization of both distanceregularity and walkregularity called mwalkregularity. Another studied concept is that of mpartial distanceregularity or, informally, distanceregularity up to distance m. Using eigenvalues of graphs and the predistance polynomials, we discuss and relate these and other concepts of almost distanceregularity, such as their common generalization of ( ,m)walkregularity. We introduce the concepts of punctual distanceregularity and punctual walkregularity as a fundament upon which almost distanceregular graphs are built. We provide examples that are mostly taken from the Foster census, a collection of symmetric cubic graphs. Two problems are posed that are related to the question of when almost distanceregular becomes whole distanceregular. We also give several characterizations of punctually distanceregular graphs that are generalizations of the spectral excess theorem. 
Characterizing (l, m)walkregular graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Linear algebra and its applications
Date of publication: 20101230
Journal article
View Share Reference managers 
A simple proof of the spectral excess theorem for distanceregular graphs
Fiol Mora, Miquel Àngel; Gago Alvarez, Silvia; Garriga Valle, Ernest
Linear algebra and its applications
Date of publication: 20100415
Journal article
Read the abstract View Share Reference managersThe spectral excess theorem provides a quasispectral characterization for a (regular) graph Γ with d+1 distinct eigenvalues to be distanceregular graph, in terms of the excess (number of vertices at distance d) of each of its vertices. The original approach, due to Fiol and Garriga in 1997, was obtained by using a local approach, so giving a characterization of the socalled pseudodistanceregularity around a vertex. In this paper we present a new simple projection method based in a global point of view, and where the mean excess plays an essential role. 
Combinatorial vs. Algebraic Characterizations of Completely PseudoRegular Codes
Cámara Vallejo, Marc; Fàbrega Canudas, Josep; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Electronic journal of combinatorics
Date of publication: 20100308
Journal article
View Share Reference managers 
The geometry of tspreads in kwalkregular graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Journal of graph theory
Date of publication: 201008
Journal article
Read the abstract Access to the full text Share Reference managersA graph is walkregular if the number of closed walks of length rooted at a given vertex is a constant through all the vertices for all . For a walkregular graph G with d+1 different eigenvalues and spectrally maximum diameter D=d, we study the geometry of its dspreads, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency matrix, we show that they form a simplex (or tetrahedron in a threedimensional case) and we compute its parameters. Moreover, the results are generalized to the case of kwalkregular graphs, a family which includes both walkregular and distanceregular graphs, and their tspreads or vertices at distance t from each other. 
On Almost DistanceRegular Graphs
Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Gorissen, Bram
Date: 20100312
Report
Access to the full text Share Reference managers 
Local spectrum of the subconstituents and completely pseudoregular 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: 20100708
Presentation of work at congresses
Share Reference managers 
When almost distanceregularity attains distanceregularity
Dalfo Simo, Cristina; Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
French Combinatorial Conference
Presentation's date: 20100628
Presentation of work at congresses
Read the abstract Access to the full text Share Reference managersGenerally speaking, `almost distanceregular graphs' are graphs which share some, but not necessarily all, regularity properties that characterize distanceregular graphs. In this paper we rst propose four basic di erent (but closely related) concepts of almost distanceregularity. In some cases, they coincide with concepts introduced before by other authors, such as walkregular graphs and partially distanceregular graphs. Here it is always assumed that the diameter D of the graph attains its maximum possible value allowed by its number d+1 of di erent eigenvalues; that is, D = d, as happens in every distanceregular graph. Our study focuses on nding out when almost distance regularity leads to distanceregularity. In other words, some `economic' (in the sense of minimizing the number of conditions) old and new characterizations of distance regularity are discussed. For instance, if A0;A1; : : : ;AD and E0;E1; : : : ;Ed denote, respectively, the distance matrices and the idempotents of the graph; and D and A stand for their respective linear spans, any of the two following `dual' conditions su ce: (a) A0;A1;AD 2 A; (b) E0;E1;Ed 2 D. Moreover, other characterizations based on the preintersection parameters, the average intersection numbers and the recurrence coe cients are obtained. In some cases, our results can be also seen as a generalization of the socalled spectral excess theorem for distanceregular graphs. 
Dual concepts of almost distanceregularity and the spectral excess theorem
Dalfo Simo, Cristina; Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
International Workshop on Optimal Network Topologies
Presentation of work at congresses
Access to the full text Share Reference managers 
A taste of duality in almost distanceregularity
Fiol Mora, Miquel Àngel; Dalfo Simo, Cristina; Van Dam, Edwin R; Garriga Valle, Ernest
SwedishCatalan Conference in Mathematics
Presentation's date: 20100917
Presentation of work at congresses
View Share Reference managers 
When almost distance regularity attains distance regularity
Dalfo Simo, Cristina; Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
International Workshop on Optimal Network Topologies
Presentation's date: 20100610
Presentation of work at congresses
View Share Reference managers 
On almost distanceregular graphs
Dalfo Simo, Cristina; Van Dam, Edwin R; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Gorissen, Bram
Joint Mathematical Conference CSASC
Presentation's date: 20100125
Presentation of work at congresses
Share Reference managers 
On tcliques in kwalkregular graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Electronic notes in discrete mathematics
Date of publication: 200908
Journal article
Read the abstract View Share Reference managersA graph is walkregular if the number of cycles of length rooted at a given vertex is a constant through all the vertices. For a walkregular graph G with d+1 different eigenvalues and spectrally maximum diameter D = d, we study the geometry of its dcliques, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency matrix, we show that they form a regular tetrahedron and we compute its parameters. Moreover, the results are generalized to the case of kwalkregular graphs, a family which includes both walkregular and distanceregular graphs, and their tcliques or vertices at distance t from each other. 
COMBINATÒRIA , TEORIA DE GRAFS I APLICACIONS
Moragas Vilarnau, Jordi; Comellas Padro, Francesc de Paula; López Masip, Susana Clara; Mitjana Riera, Margarida; Llado Sanchez, Anna; Barriere Figueroa, Eulalia; Pérez Mansilla, Sonia; Zaragoza Monroig, Maria Luisa; Gomez Marti, Jose; Miralles De La Asuncion, Alicia; Garriga Valle, Ernest; Espona Dones, Margarida; Muñoz Lopez, Francisco Javier; Dalfo Simo, Cristina; Rius Font, Miquel; Aroca Farrerons, Josep Maria; Aguilo Gost, Francisco de Asis Luis; 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 
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 
On tcliques in kwalkregular graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
EUROCOMB'09: European Conference on Combinatorics, Graph Theory and Applicactions
Presentation's date: 20090910
Presentation of work at congresses
Read the abstract View Share Reference managersA graph is walkregular if the number of cycles of length rooted at a given vertex is a constant through all the vertices. For a walkregular graph G with d+1 different eigenvalues and spectrally maximum diameter D = d, we study the geometry of its dcliques, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency matrix, we show that they form a regular tetrahedron and we compute its parameters. Moreover, the results are generalized to the case of kwalkregular graphs, a family which includes both walkregular and distanceregular graphs, and their tcliques or vertices at distance t from each other. 
On kwalkregular graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
British Combinatorial Conference
Presentation of work at congresses
Share Reference managers 
Number of walks and degree powers in a graph
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Discrete mathematics
Date of publication: 200904
Journal article
Share Reference managers 
On kWalkRegular graphs
Dalfo Simo, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Electronic journal of combinatorics
Date of publication: 200904
Journal article
Share Reference managers 
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: 200907
Journal article
View Share Reference managers 
Algunas aplicaciones de polinomios ortogonales de variable discreta a grafos y códigos
Garriga Valle, Ernest
Seminario de Matemática Discreta
Presentation's date: 20080909
Presentation of work at congresses
Share Reference managers 
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: 20080909
Presentation of work at congresses
Share Reference managers 
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 
A new Approach to the Spectral Excess Theorem for DistanceRegular Graphs
Gago Alvarez, Silvia; Garriga Valle, Ernest; Fiol Mora, Miquel Àngel
Workshop on Spectral Graph Theory with applications on Computer Science, Combinatorial Optimization and Chemistry
Presentation's date: 20081201
Presentation of work at congresses
Read the abstract Access to the full text Share Reference managersThe Spectral Excess Theorem provides a quasispectral characterization for a (regular) graph $\Gamma$ with $d+1$ different eigenvalues to be distanceregular graph, in terms of the mean (d1)excess of its vertices.\ The original approach, due to Fiol and Garriga in $1997$, was obtained in a wide context from a local point of view, so giving a characterization of the socalled pseudodistanceregularity around a vertex.\ In this paper we present a new simple method based in a global point of view, and where the mean degree of the distance$d$ graph $\Gamma_d$ plays an essential role. 
Una experiencia docente orientada a incrementar el trabajo personal del estudiante
Otero Calviño, Beatriz; Martí Farré, Jaume; Garriga Valle, Ernest; Alonso Maleta, Maria Aranzazu; LLUIS, PRAT; Prat Viñas, Luis
Jornadas de Enseñanza Universitaria de la Informática
Presentation of work at congresses
Share Reference managers 
Spectral and Geometric Properties of kWalkRegular Graphs
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Electronic notes in discrete mathematics
Date of publication: 200708
Journal article
Share Reference managers 
Number of Walks and Degree Powers in a Graph*
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Date: 200604
Report
Share Reference managers 
On outindependent subgraphs of strongly regular graphs
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Linear and multilinear algebra
Date of publication: 200603
Journal article
View Share Reference managers 
On the spectrum of an extremal graph with four eigenvalues
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Discrete mathematics
Date of publication: 200609
Journal article
View Share Reference managers 
Combinatòria, Teoria de Grafs i Aplicacions
Aguilo Gost, Francisco de Asis Luis; Serra Albo, Oriol; 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 
Avoiding monocoloured triangles when colouring Kn
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Andres Yebra, Jose Luis
Date: 200408
Report
Share Reference managers 
Aprenentatge de càlcul1. successions, contiuïtat i derivació.
Aguilo Gost, Francisco de Asis Luis; Miralles De La Asuncion, Alicia; Garriga Valle, Ernest; Barguilla Navarrete, Jorge
Date of publication: 20020930
Book
View Share Reference managers 
Aprenentatge de Càlcul 2. Integració i sèries.
Aguilo Gost, Francisco de Asis Luis; Garriga Valle, Ernest; Miralles De La Asuncion, Alicia; Barguilla Navarrete, Jorge
Date of publication: 20020930
Book
View Share Reference managers 
An algebraic characterization of completely regular codes in distanceregular graphs
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
SIAM journal on discrete mathematics
Date of publication: 200203
Journal article
Share Reference managers 
Pseudostrong regularity around a set
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Linear and multilinear algebra
Date of publication: 200203
Journal article
Share Reference managers 
Some algebraic characterization of completely regular and perfect codes
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
British Combinatorial Conference
Presentation of work at congresses
Share Reference managers 
Algebraic characterizations of completely regular codes
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
SIAM journal on discrete mathematics
Date of publication: 200110
Journal article
Share Reference managers 
Boundary graphs: The limit case of a spectral property
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Andres Yebra, Jose Luis
Discrete mathematics
Date of publication: 200101
Journal article
Share Reference managers 
AN ALGEBRAIC CHARACTERIZATION OF COMPLETELY REGULAR CODES IN DISTANCEREGULAR GRAPHS. Codi Biblioteca 1400449878
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Date: 200008
Report
Share Reference managers
Filter results
UPC network collaboration
Reference managers
Continue