Miguel Angel Fiol

CoRR, 2019

2018

On bipartite-mixed graphs.

[BibT_eX]

[DOI]

Nacho López

J. Graph Theory, 2018

Graphs, friends and acquaintances.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2018

An improved upper bound for the order of mixed graphs.

[BibT_eX]

[DOI]

Nacho López

Discret. Math., 2018

Measures of Edge-Uncolorability of Cubic Graphs.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Eckhard Steffen

Electron. J. Comb., 2018

2017

A Note on the Order of Iterated Line Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Distance mean-regular graphs.

[BibT_eX]

[DOI]

Victor Diego

Des. Codes Cryptogr., 2017

Sequence mixed graphs.

[BibT_eX]

[DOI]

Nacho López

Discret. Appl. Math., 2017

2016

Some spectral and quasi-spectral characterizations of distance-regular graphs.

[BibT_eX]

[DOI]

Aida Abiad

Edwin R. van Dam

J. Comb. Theory A, 2016

A geometric approach to dense Cayley digraphs of finite Abelian groups.

[BibT_eX]

[DOI]

Sonia Pérez

Electron. Notes Discret. Math., 2016

Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree.

[BibT_eX]

[DOI]

Sonia Pérez

Electron. J. Comb., 2016

2015

The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On middle cube graphs.

[BibT_eX]

[DOI]

Margarida Mitjana

Electron. J. Graph Theory Appl., 2015

Deterministic hierarchical networks.

[BibT_eX]

[DOI]

CoRR, 2015

Some Results on the Structure of Multipoles in the Study of Snarks.

[BibT_eX]

[DOI]

J. Vilaltella

Electron. J. Comb., 2015

2014

The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance.

[BibT_eX]

[DOI]

Miquel Angel Fiol

Electron. J. Graph Theory Appl., 2014

Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231].

[BibT_eX]

[DOI]

Aida Abiad

Eur. J. Comb., 2014

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

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

[BibT_eX]

[DOI]

Miquel Angel Fiol

J. Interconnect. Networks, 2013

On some approaches to the spectral excess theorem for nonregular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Edge-distance-regular graphs are distance-regular.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

ID Routing Mechanism for Opportunistic Multi-Hop Networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2013

The Manhattan product of digraphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2013

Algebraic characterizations of regularity properties in bipartite graphs.

[BibT_eX]

[DOI]

Aida Abiad

Eur. J. Comb., 2013

Moments in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

The Spectral Excess Theorem for Distance-Biregular Graphs.

[BibT_eX]

[DOI]

Miquel Angel Fiol

Electron. J. Comb., 2013

2012

Dual concepts of almost distance-regularity and the spectral excess theorem.

[BibT_eX]

[DOI]

Discret. Math., 2012

The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs

[BibT_eX]

[DOI]

CoRR, 2012

A simple and fast heuristic algorithm for edge-coloring of graphs

[BibT_eX]

[DOI]

J. Vilaltella

CoRR, 2012

A Short Proof of the Odd-Girth Theorem.

[BibT_eX]

[DOI]

Edwin R. van Dam

Electron. J. Comb., 2012

2011

Performance analysis of the Sent-But-Sure strategy for Optical Burst and Packet Switched Networks.

[BibT_eX]

[DOI]

Perform. Evaluation, 2011

On almost distance-regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Edge-distance-regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

A Differential Approach for Bounding the Index of Graphs under Perturbations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

The geometry of t-spreads in k-walk-regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

The local spectra of regular line graphs.

[BibT_eX]

[DOI]

Margarida Mitjana

Discret. Math., 2010

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

A Routing and Wavelength Assignment Strategy for Successful Transmission in Optical Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

Load-balanced wavelength assignment strategies for optical burst/packet switching networks.

[BibT_eX]

[DOI]

IET Commun., 2009

On t-Cliques in k-Walk-Regular Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Number of walks and degree powers in a graph.

[BibT_eX]

[DOI]

Discret. Math., 2009

The generalized hierarchical product of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

The hierarchical product of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On k-Walk-Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Multidimensional Manhattan Street Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

A general resource assignment scheme for successful transmission in optical burst switched networks.

[BibT_eX]

[DOI]

Opt. Switch. Netw., 2008

2007

The Local Spectra of Line Graphs.

[BibT_eX]

[DOI]

Margarida Mitjana

Electron. Notes Discret. Math., 2007

Spectral and Geometric Properties of k-Walk-Regular Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

The Multidimensional Manhattan Network.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

A Spectral Study of the Manhattan Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

On the fairness issue in OBS loss-free schemes.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Broadband Communications, 2007

2006

On the spectrum of an extremal graph with four eigenvalues.

[BibT_eX]

[DOI]

Discret. Math., 2006

Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Broadband Communications, 2006

A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Broadband Communications, 2006

2004

Weakly distance-regular digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

2003

The spectra of wrapped butterfly digraphs.

[BibT_eX]

[DOI]

Networks, 2003

On Moore bipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Chromatic Automorphisms of Consecutive Digraphs.

[BibT_eX]

[DOI]

Josep M. Brunat

Montserrat Maureso

Graphs Comb., 2003

A General Spectral Bound For Distant Vertex Subsets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Connectivity and Traversability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Algebraic characterizations of distance-regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

On the Spectrum of a Weakly Distance-Regular Digraph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Boundary graphs: The limit case of a spectral property.

[BibT_eX]

[DOI]

Discret. Math., 2001

Some Spectral Characterizations Of Strongly Distance-Regular Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

2000

Periodic Tilings as a Dissection Method.

[BibT_eX]

[DOI]

Maria Lluisa Fiol

Am. Math. Mon., 2000

On Twisted Odd Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

Quasi-Spectral Characterization of Strongly Distance-Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

1999

Cayley Digraphs from Complete Generalized Cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

Superconnectivity of bipartite digraphs and graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

From regular boundary graphs to antipodal distance-regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Boundary graphs - II The limit case of a spectral property.

[BibT_eX]

[DOI]

Discret. Math., 1998

The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs.

[BibT_eX]

[DOI]

E. Carriga

J. Comb. Theory B, 1997

The alternating polynomials and their relation with the spectra and conditional diameters of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Digraphs on permutations.

[BibT_eX]

[DOI]

Josep M. Brunat

Maria Lluisa Fiol

Discret. Math., 1997

Extraconnectivity of graphs with large minimum degree and girth.

[BibT_eX]

[DOI]

Discret. Math., 1997

On the order and size of s-geodetic digraphs with given connectivity.

[BibT_eX]

[DOI]

Discret. Math., 1997

Connectivity of large bipartite digraphs and graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Triple loop networks with small transmission delay.

[BibT_eX]

[DOI]

C. Garcia

Discret. Math., 1997

An Eigenvalue Characterization of Antipodal Distance Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

1996

Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs".

[BibT_eX]

[DOI]

Carles Padró

Paz Morillo

IEEE Trans. Computers, 1996

On the connectivity and the conditional diameter of graphs and digraphs.

[BibT_eX]

[DOI]

Networks, 1996

Distance connectivity in graphs and digraphs.

[BibT_eX]

[DOI]

M. C. Balbuena

Ángeles Carmona

J. Graph Theory, 1996

On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

Locally Pseudo-Distance-Regular Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

On the extraconnectivity of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Bipartite Graphs and Digraphs with Maximum Connectivity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1995

On congruence in Zn and the dimension of a multidimensional circulant.

[BibT_eX]

[DOI]

Discret. Math., 1995

On Cayley line digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1995

An efficient algorithm to find optimal double loop networks.

[BibT_eX]

[DOI]

Discret. Math., 1995

Vertex-symmetric Digraphs with Small Diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

On Large Vertex Symmetric 2-Reachable Digraphs.

[BibT_eX]

[DOI]

José Gómez

Parallel Process. Lett., 1994

On the distance connectivity of graphs and digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

The superconnectivity of large digraphs and graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Extraconnectivity of graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

A Unified Approach to the design and Control of Dynamic Memory Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

The connectivity of large digraphs and graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

On large (Delta, D)-graphs.

[BibT_eX]

[DOI]

J. Gómez

Oriol Serra

Discret. Math., 1993

Double commutative-step digraphs with minimum diameters.

[BibT_eX]

[DOI]

Pilar Esqué

Discret. Math., 1993

1992

The Partial Line Digraph Technique in the Design of Large Interconnection Networks.

[BibT_eX]

[DOI]

Anna S. Lladó

IEEE Trans. Computers, 1992

On super-edge-connected digraphs and bipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

Graphs on Alphabets as Models for Large Interconnection Networks.

[BibT_eX]

[DOI]

José Gómez

Discret. Appl. Math., 1992

1990

Dense bipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1989

Maximally connected digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

1987

A Discrete Optimization Problem in Local Networks and Data Alignment.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

Congruences in Zn, finite Abelian groups and the Chinese remainder theorem.

[BibT_eX]

[DOI]

Discret. Math., 1987

On the (d, D, D, s) - Digraph Problem.

[BibT_eX]

[DOI]

Paz Morillo

J. Guitart

Proceedings of the Applied Algebra, 1987

An Algebraic Model for the Storage of Data in Parallel Memories.

[BibT_eX]

[DOI]

Oriol Serra

Proceedings of the Applied Algebra, 1987

1986

Some large graphs with given degree and diameter.

[BibT_eX]

[DOI]

Ignacio Alegre

J. Graph Theory, 1986

1984

Line Digraph Iterations and the (d, k) Digraph Problem.

[BibT_eX]

[DOI]

Ignacio Alegre de Miquel

IEEE Trans. Computers, 1984

1983

Reduction of Connections for Multibus Organization.

[BibT_eX]

[DOI]

Tomás Lang

Mateo Valero

IEEE Trans. Computers, 1983

Line Digraph Iterations and the (d,k) Problem for Directed Graphs

[BibT_eX]

[DOI]

Ignacio Alegre