2009 |
59 | EE | Lali Barrière,
Francesc Comellas,
Cristina Dalfó,
Miguel Angel Fiol:
The hierarchical product of graphs.
Discrete Applied Mathematics 157(1): 36-48 (2009) |
2007 |
58 | EE | Anna Agusti-Torra,
Cristina Cervello-Pastor,
Miguel Angel Fiol:
On the fairness issue in OBS loss-free schemes.
BROADNETS 2007: 55-64 |
57 | EE | Miguel Angel Fiol,
Margarida Mitjana:
The Local Spectra of Line Graphs.
Electronic Notes in Discrete Mathematics 28: 95-102 (2007) |
56 | EE | Francesc Comellas,
Cristina Dalfó,
Miguel Angel Fiol,
Margarida Mitjana:
A Spectral Study of the Manhattan Networks.
Electronic Notes in Discrete Mathematics 29: 267-271 (2007) |
55 | EE | Miguel Angel Fiol,
Ernest Garriga:
Spectral and Geometric Properties of k-Walk-Regular Graphs.
Electronic Notes in Discrete Mathematics 29: 333-337 (2007) |
54 | EE | Cristina Dalfó,
Francesc Comellas,
Miguel Angel Fiol:
The Multidimensional Manhattan Network.
Electronic Notes in Discrete Mathematics 29: 383-387 (2007) |
2006 |
53 | EE | Anna Agusti-Torra,
Cristina Cervello-Pastor,
Miguel Angel Fiol:
A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks.
BROADNETS 2006 |
52 | EE | Anna Agusti-Torra,
Cristina Cervello-Pastor,
Miguel Angel Fiol:
Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings.
BROADNETS 2006 |
51 | EE | Miguel Angel Fiol,
Ernest Garriga:
On the spectrum of an extremal graph with four eigenvalues.
Discrete Mathematics 306(18): 2241-2244 (2006) |
2004 |
50 | EE | Francesc Comellas,
Miguel Angel Fiol,
Joan Gimbert,
Margarida Mitjana:
Weakly distance-regular digraphs.
J. Comb. Theory, Ser. B 90(2): 233-255 (2004) |
2003 |
49 | | Miguel Angel Fiol:
A General Spectral Bound For Distant Vertex Subsets.
Combinatorics, Probability & Computing 12(1): (2003) |
48 | EE | Josep M. Brunat,
Miguel Angel Fiol,
Montserrat Maureso:
Chromatic Automorphisms of Consecutive Digraphs.
Graphs and Combinatorics 19(2): 145-159 (2003) |
47 | EE | Francesc Comellas,
Miguel Angel Fiol,
Joan Gimbert,
Margarida Mitjana:
The spectra of wrapped butterfly digraphs.
Networks 42(1): 15-19 (2003) |
2002 |
46 | EE | Miguel Angel Fiol:
Algebraic characterizations of distance-regular graphs.
Discrete Mathematics 246(1-3): 111-129 (2002) |
2001 |
45 | | Miguel Angel Fiol:
Some Spectral Characterizations Of Strongly Distance-Regular Graphs.
Combinatorics, Probability & Computing 10(2): (2001) |
44 | EE | Miguel Angel Fiol,
Ernest Garriga,
José Luis Andres Yebra:
Boundary graphs: The limit case of a spectral property.
Discrete Mathematics 226(1-3): 155-173 (2001) |
43 | EE | Francesc Comellas,
Miguel Angel Fiol,
Joan Gimbert,
Margarida Mitjana:
On the Spectrum of a Weakly Distance-Regular Digraph.
Electronic Notes in Discrete Mathematics 10: 80-83 (2001) |
42 | EE | Miguel Angel Fiol,
Ernest Garriga:
An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs.
SIAM J. Discrete Math. 15(1): 1-13 (2001) |
2000 |
41 | | Miguel Angel Fiol,
Ernest Garriga,
J. Luis A. Yebra:
On Twisted Odd Graphs.
Combinatorics, Probability & Computing 9(3): (2000) |
40 | EE | Miguel Angel Fiol:
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs.
Electr. J. Comb. 7: (2000) |
1999 |
39 | EE | Camino Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
Superconnectivity of bipartite digraphs and graphs.
Discrete Mathematics 197-198: 61-75 (1999) |
38 | EE | Josep M. Brunat,
Margarida Espona,
Miguel Angel Fiol,
Oriol Serra:
Cayley Digraphs from Complete Generalized Cycles.
Eur. J. Comb. 20(5): 337-349 (1999) |
1998 |
37 | EE | Miguel Angel Fiol,
Ernest Garriga:
The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs.
Discrete Applied Mathematics 87(1-3): 77-97 (1998) |
36 | EE | Miguel Angel Fiol,
Ernest Garriga,
José Luis Andres Yebra:
Boundary graphs - II The limit case of a spectral property.
Discrete Mathematics 182(1-3): 101-111 (1998) |
1997 |
35 | EE | Miguel Angel Fiol,
Ernest Garriga,
José Luis Andres Yebra:
The alternating polynomials and their relation with the spectra and conditional diameters of graphs.
Discrete Mathematics 167-168: 297-307 (1997) |
34 | EE | F. Aguiló,
Miguel Angel Fiol,
C. Garcia:
Triple loop networks with small transmission delay.
Discrete Mathematics 167-168: 3-16 (1997) |
33 | EE | Camino Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
Extraconnectivity of graphs with large minimum degree and girth.
Discrete Mathematics 167-168: 85-100 (1997) |
32 | EE | M. C. Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
On the order and size of s-geodetic digraphs with given connectivity.
Discrete Mathematics 174(1-3): 19-27 (1997) |
31 | EE | M. C. Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
Connectivity of large bipartite digraphs and graphs.
Discrete Mathematics 174(1-3): 3-17 (1997) |
30 | EE | Josep M. Brunat,
Miguel Angel Fiol,
M. L. Fiol:
Digraphs on permutations.
Discrete Mathematics 174(1-3): 73-86 (1997) |
29 | EE | Miguel Angel Fiol:
An Eigenvalue Characterization of Antipodal Distance Regular Graphs.
Electr. J. Comb. 4(1): (1997) |
28 | EE | Miguel Angel Fiol:
Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra.
Electr. J. Comb. 4(1): (1997) |
27 | EE | Miguel Angel Fiol,
E. Carriga:
From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs.
J. Comb. Theory, Ser. B 71(2): 162-183 (1997) |
1996 |
26 | EE | Josep Fàbrega,
Miguel Angel Fiol:
Bipartite Graphs and Digraphs with Maximum Connectivity.
Discrete Applied Mathematics 69(3): 271-279 (1996) |
25 | EE | Josep Fàbrega,
Miguel Angel Fiol:
On the extraconnectivity of graphs.
Discrete Mathematics 155(1-3): 49-57 (1996) |
24 | | Carles Padró,
Paz Morillo,
Miguel Angel Fiol:
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs".
IEEE Trans. Computers 45(6): 768 (1996) |
23 | EE | Miguel Angel Fiol,
Ernest Garriga,
José Luis Andres Yebra:
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs.
J. Comb. Theory, Ser. B 67(1): 48-61 (1996) |
22 | EE | Miguel Angel Fiol,
Ernest Garriga,
José Luis Andres Yebra:
Locally Pseudo-Distance-Regular Graphs.
J. Comb. Theory, Ser. B 68(2): 179-205 (1996) |
21 | EE | Camino Balbuena,
Angeles Carmona,
Josep Fàbrega,
Miguel Angel Fiol:
On the connectivity and the conditional diameter of graphs and digraphs.
Networks 28(2): 97-105 (1996) |
1995 |
20 | EE | Francesc Comellas,
Miguel Angel Fiol:
Vertex-symmetric Digraphs with Small Diameter.
Discrete Applied Mathematics 58(1): 1-11 (1995) |
19 | EE | Josep M. Brunat,
Margarida Espona,
Miguel Angel Fiol,
Oriol Serra:
On Cayley line digraphs.
Discrete Mathematics 138(1-3): 147-159 (1995) |
18 | EE | F. Aguiló,
Miguel Angel Fiol:
An efficient algorithm to find optimal double loop networks.
Discrete Mathematics 138(1-3): 15-29 (1995) |
17 | EE | Miguel Angel Fiol:
On congruence in Zn and the dimension of a multidimensional circulant.
Discrete Mathematics 141(1-3): 123-134 (1995) |
1994 |
16 | EE | Miguel Angel Fiol:
The superconnectivity of large digraphs and graphs.
Discrete Mathematics 124(1-3): 67-78 (1994) |
15 | EE | Miguel Angel Fiol,
Josep Fàbrega:
On the distance connectivity of graphs and digraphs.
Discrete Mathematics 125(1-3): 169-176 (1994) |
14 | EE | Josep Fàbrega,
Miguel Angel Fiol:
Extraconnectivity of graphs with large girth.
Discrete Mathematics 127(1-3): 163-170 (1994) |
13 | | Francesc Comellas,
Miguel Angel Fiol,
José Gómez:
On Large Vertex Symmetric 2-Reachable Digraphs.
Parallel Processing Letters 4: 379-384 (1994) |
1993 |
12 | EE | Pilar Esqué,
F. Aguiló,
Miguel Angel Fiol:
Double commutative-step digraphs with minimum diameters.
Discrete Mathematics 114(1-3): 147-157 (1993) |
11 | EE | J. Gómez,
Miguel Angel Fiol,
Oriol Serra:
On large (Delta, D)-graphs.
Discrete Mathematics 114(1-3): 219-235 (1993) |
10 | | Miguel Angel Fiol,
Josep Fàbrega,
Oriol Serra,
J. Luis A. Yebra:
A Unified Approach to the design and Control of Dynamic Memory Networks.
Parallel Processing Letters 3: 445-456 (1993) |
1992 |
9 | EE | José Gómez,
Miguel Angel Fiol,
J. Luis A. Yebra:
Graphs on Alphabets as Models for Large Interconnection Networks.
Discrete Applied Mathematics 37/38: 227-243 (1992) |
8 | | Miguel Angel Fiol,
Anna S. Lladó:
The Partial Line Digraph Technique in the Design of Large Interconnection Networks.
IEEE Trans. Computers 41(7): 848-857 (1992) |
1987 |
7 | | Miguel Angel Fiol,
Oriol Serra:
An Algebraic Model for the Storage of Data in Parallel Memories.
AAECC 1987: 238-246 |
6 | | Paz Morillo,
Miguel Angel Fiol,
J. Guitart:
On the (d, D, D, s) - Digraph Problem.
AAECC 1987: 334-340 |
5 | EE | Miguel Angel Fiol:
Congruences in Zn, finite Abelian groups and the Chinese remainder theorem.
Discrete Mathematics 67(1): 101-105 (1987) |
4 | | Miguel Angel Fiol,
J. Luis A. Yebra,
Ignacio Alegre,
Mateo Valero:
A Discrete Optimization Problem in Local Networks and Data Alignment.
IEEE Trans. Computers 36(6): 702-713 (1987) |
1984 |
3 | | Miguel Angel Fiol,
J. Luis A. Yebra,
Ignacio Alegre de Miquel:
Line Digraph Iterations and the (d, k) Digraph Problem.
IEEE Trans. Computers 33(5): 400-403 (1984) |
1983 |
2 | | Miguel Angel Fiol,
Ignacio Alegre,
J. Luis A. Yebra:
Line Digraph Iterations and the (d,k) Problem for Directed Graphs
ISCA 1983: 174-177 |
1 | | Tomás Lang,
Mateo Valero,
Miguel Angel Fiol:
Reduction of Connections for Multibus Organization.
IEEE Trans. Computers 32(8): 707-716 (1983) |