Line Digraph Iterations and the (d,k) Problem for Directed Graphs - Miguel Angel Fiol; Ignacio Alegre; J. Luis A. Yebra (ISCA, 1983)

Reduction of Connections for Multibus Organization. - Tomás Lang; Mateo Valero; Miguel Angel Fiol (IEEE Trans. Computers, 1983)

Line Digraph Iterations and the (d, k) Digraph Problem. - Miguel Angel Fiol; J. Luis A. Yebra; Ignacio Alegre de Miquel (IEEE Trans. Computers, 1984)

Some large graphs with given degree and diameter. - Ignacio Alegre; Miguel Angel Fiol; J. Luis A. Yebra (J. Graph Theory, 1986)

An Algebraic Model for the Storage of Data in Parallel Memories. - Miguel Angel Fiol; Oriol Serra (AAECC, 1987)

On the (d, D, D, s) - Digraph Problem. - Paz Morillo; Miguel Angel Fiol; J. Guitart (AAECC, 1987)

Congruences in Zn, finite Abelian groups and the Chinese remainder theorem. - Miguel Angel Fiol (Discret. Math., 1987)

A Discrete Optimization Problem in Local Networks and Data Alignment. - Miguel Angel Fiol; J. Luis A. Yebra; Ignacio Alegre; Mateo Valero (IEEE Trans. Computers, 1987)

Maximally connected digraphs. - Josep Fàbrega; Miguel Angel Fiol (J. Graph Theory, 1989)

Dense bipartite digraphs. - Miguel Angel Fiol; José Luis Andres Yebra (J. Graph Theory, 1990)

Graphs on Alphabets as Models for Large Interconnection Networks. - José Gómez; Miguel Angel Fiol; J. Luis A. Yebra (Discret. Appl. Math., 1992)

On super-edge-connected digraphs and bipartite digraphs. - Miguel Angel Fiol (J. Graph Theory, 1992)

The Partial Line Digraph Technique in the Design of Large Interconnection Networks. - Miguel Angel Fiol; Anna S. Lladó (IEEE Trans. Computers, 1992)

Double commutative-step digraphs with minimum diameters. - Pilar Esqué; Francesc Aguiló; Miguel Angel Fiol (Discret. Math., 1993)

On large (Delta, D)-graphs. - J. Gómez; Miguel Angel Fiol; Oriol Serra (Discret. Math., 1993)

The connectivity of large digraphs and graphs. - Miquel A. Fiol (J. Graph Theory, 1993)

A Unified Approach to the design and Control of Dynamic Memory Networks. - Miguel Angel Fiol; Josep Fàbrega; Oriol Serra; J. Luis A. Yebra (Parallel Process. Lett., 1993)

Extraconnectivity of graphs with large girth. - Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1994)

The superconnectivity of large digraphs and graphs. - Miguel Angel Fiol (Discret. Math., 1994)

On the distance connectivity of graphs and digraphs. - Miguel Angel Fiol; Josep Fàbrega (Discret. Math., 1994)

On Large Vertex Symmetric 2-Reachable Digraphs. - Francesc Comellas; Miguel Angel Fiol; José Gómez (Parallel Process. Lett., 1994)

Vertex-symmetric Digraphs with Small Diameter. - Francesc Comellas; Miguel Angel Fiol (Discret. Appl. Math., 1995)

An efficient algorithm to find optimal double loop networks. - Francesc Aguiló; Miguel Angel Fiol (Discret. Math., 1995)

On Cayley line digraphs. - Josep M. Brunat; Margarida Espona; Miguel Angel Fiol; Oriol Serra (Discret. Math., 1995)

On congruence in Zn and the dimension of a multidimensional circulant. - Miguel Angel Fiol (Discret. Math., 1995)

Bipartite Graphs and Digraphs with Maximum Connectivity. - Josep Fàbrega; Miguel Angel Fiol (Discret. Appl. Math., 1996)

On the extraconnectivity of graphs. - Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1996)

Locally Pseudo-Distance-Regular Graphs. - Miguel Angel Fiol; Ernest Garriga; José Luis Andres Yebra (J. Comb. Theory, Ser. B, 1996)

On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs. - Miguel Angel Fiol; Ernest Garriga; José Luis Andres Yebra (J. Comb. Theory B, 1996)

Distance connectivity in graphs and digraphs. - M. C. Balbuena; Ángeles Carmona; Miguel Angel Fiol (J. Graph Theory, 1996)

On the connectivity and the conditional diameter of graphs and digraphs. - Camino Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Networks, 1996)

Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". - Carles Padró; Paz Morillo; Miguel Angel Fiol (IEEE Trans. Computers, 1996)

Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra. - Miguel Angel Fiol (Electron. J. Comb., 1997)

An Eigenvalue Characterization of Antipodal Distance Regular Graphs. - Miguel Angel Fiol (Electron. J. Comb., 1997)

Triple loop networks with small transmission delay. - Francesc Aguiló; Miguel Angel Fiol; C. Garcia (Discret. Math., 1997)

Connectivity of large bipartite digraphs and graphs. - M. C. Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1997)

On the order and size of s-geodetic digraphs with given connectivity. - M. C. Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1997)

Extraconnectivity of graphs with large minimum degree and girth. - Camino Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1997)

Digraphs on permutations. - Josep M. Brunat; Miguel Angel Fiol; Maria Lluisa Fiol (Discret. Math., 1997)

The alternating polynomials and their relation with the spectra and conditional diameters of graphs. - Miguel Angel Fiol; Ernest Garriga; José Luis Andres Yebra (Discret. Math., 1997)

From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs. - Miguel Angel Fiol; E. Carriga (J. Comb. Theory B, 1997)

The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. - Miguel Angel Fiol; Ernest Garriga (Discret. Appl. Math., 1998)

Boundary graphs - II The limit case of a spectral property. - Miguel Angel Fiol; Ernest Garriga; José Luis Andres Yebra (Discret. Math., 1998)

From regular boundary graphs to antipodal distance-regular graphs. - Miguel Angel Fiol; Ernest Garriga; José Luis Andres Yebra (J. Graph Theory, 1998)

Superconnectivity of bipartite digraphs and graphs. - Camino Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1999)

Cayley Digraphs from Complete Generalized Cycles. - Josep M. Brunat; Margarida Espona; Miguel Angel Fiol; Oriol Serra (Eur. J. Comb., 1999)

Quasi-Spectral Characterization of Strongly Distance-Regular Graphs. - Miguel Angel Fiol (Electron. J. Comb., 2000)

On Twisted Odd Graphs. - Miguel Angel Fiol; Ernest Garriga; J. Luis A. Yebra (Comb. Probab. Comput., 2000)

Periodic Tilings as a Dissection Method. - Francesc Aguiló; Miguel Angel Fiol; Maria Lluisa Fiol (Am. Math. Mon., 2000)

Some Spectral Characterizations Of Strongly Distance-Regular Graphs. - Miguel Angel Fiol (Comb. Probab. Comput., 2001)

Boundary graphs: The limit case of a spectral property. - Miguel Angel Fiol; Ernest Garriga; José Luis Andres Yebra (Discret. Math., 2001)

On the Spectrum of a Weakly Distance-Regular Digraph. - Francesc Comellas; Miguel Angel Fiol; Joan Gimbert; Margarida Mitjana (Electron. Notes Discret. Math., 2001)

An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs. - Miguel Angel Fiol; Ernest Garriga (SIAM J. Discret. Math., 2001)

Algebraic characterizations of distance-regular graphs. - Miguel Angel Fiol (Discret. Math., 2002)

Connectivity and Traversability. - Josep Fàbrega; Miguel Angel Fiol; Herbert Fleischner; R. Gary Parker; A Dewdney; Ronald J. Gould; Gregory Z. Gutin (Handbook of Graph Theory, 2003)

A General Spectral Bound For Distant Vertex Subsets. - Miguel Angel Fiol (Comb. Probab. Comput., 2003)

Chromatic Automorphisms of Consecutive Digraphs. - Josep M. Brunat; Miguel Angel Fiol; Montserrat Maureso (Graphs Comb., 2003)

On Moore bipartite digraphs. - Miguel Angel Fiol; Joan Gimbert; José Gómez; Yaokun Wu (J. Graph Theory, 2003)

The spectra of wrapped butterfly digraphs. - Francesc Comellas; Miguel Angel Fiol; Joan Gimbert; Margarida Mitjana (Networks, 2003)

Weakly distance-regular digraphs. - Francesc Comellas; Miguel Angel Fiol; Joan Gimbert; Margarida Mitjana (J. Comb. Theory B, 2004)

A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miguel Angel Fiol (BROADNETS, 2006)

Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miguel Angel Fiol (BROADNETS, 2006)

On the spectrum of an extremal graph with four eigenvalues. - Miguel Angel Fiol; Ernest Garriga (Discret. Math., 2006)

On the fairness issue in OBS loss-free schemes. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miguel Angel Fiol (BROADNETS, 2007)

A Spectral Study of the Manhattan Networks. - Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol; Margarida Mitjana (Electron. Notes Discret. Math., 2007)

The Multidimensional Manhattan Network. - Cristina Dalfó; Francesc Comellas; Miguel Angel Fiol (Electron. Notes Discret. Math., 2007)

Spectral and Geometric Properties of k-Walk-Regular Graphs. - Miguel Angel Fiol; Ernest Garriga (Electron. Notes Discret. Math., 2007)

The Local Spectra of Line Graphs. - Miguel Angel Fiol; Margarida Mitjana (Electron. Notes Discret. Math., 2007)

A general resource assignment scheme for successful transmission in optical burst switched networks. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miquel A. Fiol (Opt. Switch. Netw., 2008)

Multidimensional Manhattan Street Networks. - Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (SIAM J. Discret. Math., 2008)

Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes. - Marc Cámara; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (Electron. J. Comb., 2009)

On k-Walk-Regular Graphs. - Cristina Dalfó; Miguel Angel Fiol; Ernest Garriga (Electron. J. Comb., 2009)

The hierarchical product of graphs. - Lali Barrière; Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (Discret. Appl. Math., 2009)

The generalized hierarchical product of graphs. - Lali Barrière; Cristina Dalfó; Miguel Angel Fiol; Margarida Mitjana (Discret. Math., 2009)

Number of walks and degree powers in a graph. - Miguel Angel Fiol; Ernest Garriga (Discret. Math., 2009)

On t-Cliques in k-Walk-Regular Graphs. - Cristina Dalfó; Miguel Angel Fiol; Ernest Garriga (Electron. Notes Discret. Math., 2009)

Load-balanced wavelength assignment strategies for optical burst/packet switching networks. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miquel A. Fiol (IET Commun., 2009)

A Routing and Wavelength Assignment Strategy for Successful Transmission in Optical Networks. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miquel A. Fiol (J. Interconnect. Networks, 2009)

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes. - Marc Cámara; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (Electron. J. Comb., 2010)

The local spectra of regular line graphs. - Miguel Angel Fiol; Margarida Mitjana (Discret. Math., 2010)

The geometry of t-spreads in k-walk-regular graphs. - Cristina Dalfó; Miguel Angel Fiol; Ernest Garriga (J. Graph Theory, 2010)

A Differential Approach for Bounding the Index of Graphs under Perturbations. - Cristina Dalfó; Miguel Angel Fiol; Ernest Garriga (Electron. J. Comb., 2011)

Edge-distance-regular graphs. - Marc Cámara; Cristina Dalfó; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (J. Comb. Theory A, 2011)

On almost distance-regular graphs. - Cristina Dalfó; Edwin R. van Dam; Miguel Angel Fiol; Ernest Garriga; Bram L. Gorissen (J. Comb. Theory A, 2011)

Performance analysis of the Sent-But-Sure strategy for Optical Burst and Packet Switched Networks. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miquel A. Fiol (Perform. Evaluation, 2011)

A Short Proof of the Odd-Girth Theorem. - Edwin R. van Dam; Miguel Angel Fiol (Electron. J. Comb., 2012)

A simple and fast heuristic algorithm for edge-coloring of graphs - Miguel Angel Fiol; J. Vilaltella (CoRR, 2012)

The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs - Cristina Dalfó; Miguel Angel Fiol (CoRR, 2012)

Dual concepts of almost distance-regularity and the spectral excess theorem. - Cristina Dalfó; Edwin R. van Dam; Miguel Angel Fiol; Ernest Garriga (Discret. Math., 2012)

The Spectral Excess Theorem for Distance-Biregular Graphs. - Miquel Angel Fiol (Electron. J. Comb., 2013)

Moments in graphs. - Cristina Dalfó; Miguel Angel Fiol; Ernest Garriga (Discret. Appl. Math., 2013)

Algebraic characterizations of regularity properties in bipartite graphs. - Aida Abiad; Cristina Dalfó; Miguel Angel Fiol (Eur. J. Comb., 2013)

The Manhattan product of digraphs. - Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (Electron. J. Graph Theory Appl., 2013)

ID Routing Mechanism for Opportunistic Multi-Hop Networks. - Anna Agusti-Torra; Cristina Cervello-Pastor; Miquel A. Fiol (IEEE Commun. Lett., 2013)

Edge-distance-regular graphs are distance-regular. - Marc Cámara; Cristina Dalfó; Charles Delorme; Miguel Angel Fiol; H. Suzuki (J. Comb. Theory A, 2013)

On some approaches to the spectral excess theorem for nonregular graphs. - Miguel Angel Fiol (J. Comb. Theory A, 2013)

Comments on "Extremal Cayley Digraphs of Finite Abelian Groups" [Intercon. Networks 12 (2011), numbers 1-2, 125-135]. - Miquel Angel Fiol (J. Interconnect. Networks, 2013)

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes. - Marc Cámara; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (Discret. Appl. Math., 2014)

Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231]. - Aida Abiad; Cristina Dalfó; Miguel Angel Fiol (Eur. J. Comb., 2014)

The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance. - Cristina Dalfó; Miquel Angel Fiol (Electron. J. Graph Theory Appl., 2014)

Some Results on the Structure of Multipoles in the Study of Snarks. - Miguel Angel Fiol; J. Vilaltella (Electron. J. Comb., 2015)

Deterministic hierarchical networks. - Lali Barrière; Francesc Comellas; Cristina Dalfó; Miguel Angel Fiol (CoRR, 2015)

On middle cube graphs. - Cristina Dalfó; Miquel A. Fiol; Margarida Mitjana (Electron. J. Graph Theory Appl., 2015)

The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues. - Miguel Angel Fiol (Electron. Notes Discret. Math., 2015)

Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree. - Francesc Aguiló; Miguel Angel Fiol; Sonia Pérez (Electron. J. Comb., 2016)

A geometric approach to dense Cayley digraphs of finite Abelian groups. - Francesc Aguiló; Miguel Angel Fiol; Sonia Pérez (Electron. Notes Discret. Math., 2016)

Some spectral and quasi-spectral characterizations of distance-regular graphs. - Aida Abiad; Edwin R. van Dam; Miguel Angel Fiol (J. Comb. Theory A, 2016)

Sequence mixed graphs. - Cristina Dalfó; Miguel Angel Fiol; Nacho López (Discret. Appl. Math., 2017)

Distance mean-regular graphs. - Victor Diego; Miquel A. Fiol (Des. Codes Cryptogr., 2017)

A Note on the Order of Iterated Line Digraphs. - Cristina Dalfó; Miguel Angel Fiol (J. Graph Theory, 2017)

Measures of Edge-Uncolorability of Cubic Graphs. - Miquel A. Fiol; Giuseppe Mazzuoccolo; Eckhard Steffen (Electron. J. Comb., 2018)

An improved upper bound for the order of mixed graphs. - Cristina Dalfó; Miguel Angel Fiol; Nacho López (Discret. Math., 2018)

Graphs, friends and acquaintances. - Cristina Dalfó; Miguel Angel Fiol (Electron. J. Graph Theory Appl., 2018)

On bipartite-mixed graphs. - Cristina Dalfó; Miguel Angel Fiol; Nacho López (J. Graph Theory, 2018)

El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials. The method of lines for numerical solutions of partial differential equations. - Cristina Dalfó; Miquel A. Fiol (CoRR, 2019)

A new approach to gross error detection for GPS networks. - Cristina Dalfó; Miguel Angel Fiol (Discret. Appl. Math., 2019)

An algebraic approach to lifts of digraphs. - Cristina Dalfó; Miguel Angel Fiol; Mirka Miller; Joseph F. Ryan 001; Jozef Sirán (Discret. Appl. Math., 2019)

On the k-independence number of graphs. - Aida Abiad; Gabriel Coutinho; Miquel A. Fiol (Discret. Math., 2019)

A Note on a New General Family of Deterministic Hierarchical Networks. - Cristina Dalfó; Miguel Angel Fiol (J. Interconnect. Networks, 2019)

An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs. - Cristina Dalfó; Miguel Angel Fiol; Nacho López; Joseph F. Ryan 001 (Discret. Math., 2020)

On a version of the spectral excess theorem. - Miguel Angel Fiol; Safet Penjic (Electron. J. Graph Theory Appl., 2020)

New results for the Mondrian art problem. - Cristina Dalfó; Miguel Angel Fiol; Nacho López (Discret. Appl. Math., 2021)

Bipartite biregular Moore graphs. - Gabriela Araujo-Pardo; Cristina Dalfó; Miquel A. Fiol; Nacho López (Discret. Math., 2021)

Decompositions of a rectangle into non-congruent rectangles of equal area. - Cristina Dalfó; Miquel A. Fiol; Nacho López; Álvaro Martínez-Pérez (Discret. Math., 2021)

On d-Fibonacci digraphs. - Cristina Dalfó; Miguel Angel Fiol (Electron. J. Graph Theory Appl., 2021)

Optimization of eigenvalue bounds for the independence and chromatic number of graph powers. - Aida Abiad; Gabriel Coutinho; Miguel Angel Fiol; Bruno Demattos Nogueira; Sjanne Zeijlemaker (Discret. Math., 2022)

On the Spectra and Spectral Radii of Token Graphs. - Mónica Reyes; Cristina Dalfó; Miquel Angel Fiol (ITAT, 2023)

Moore mixed graphs from Cayley graphs. - Cristina Dalfó; Miguel Angel Fiol (Electron. J. Graph Theory Appl., 2023)

On inertia and ratio type bounds for the k-independence number of a graph and their relationship. - Aida Abiad; Cristina Dalfó; Miguel Angel Fiol; Sjanne Zeijlemaker (Discret. Appl. Math., 2023)

Discovering Important Nodes of Complex Networks Based on Laplacian Spectra. - Ali Moradi Amani; Miquel A. Fiol; Mahdi Jalili; Guanrong Chen; Xinghuo Yu 001; Lewi Stone (IEEE Trans. Circuits Syst. I Regul. Pap., 2023)

Integer Sequences from k-iterated Line Digraphs. - Dominika Závacká; Cristina Dalfó; Miquel Angel Fiol (ITAT, 2024)

On large regular (1,1,k)-mixed graphs. - Cristina Dalfó; Grahame Erskine; Geoffrey Exoo; Miguel Angel Fiol; Nacho López; Arnau Messegué; James Tuite (Discret. Appl. Math., 2024)

Structural and Spectral Properties of Chordal Ring, Multi-Ring, and Mixed Graphs. - M. A. Reyes; Cristina Dalfó; Miguel Angel Fiol (Symmetry, 2024)

On the algebraic connectivity of token graphs and graphs under perturbations. - Xiaodi Song; Cristina Dalfó; Miguel Angel Fiol; Shenggui Zhang (Discret. Appl. Math., 2025)

Some bounds on the Laplacian eigenvalues of token graphs. - Cristina Dalfó; Miguel Angel Fiol; Arnau Messegué (Discret. Math., 2025)