José Luis Andres Yebra

According to our database, José Luis Andres Yebra authored at least 23 papers between 1983 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

On large (Δ, <i>D</i>, <i>D</i>, 1)-graphs.

José Gómez, Josep Fàbrega, José Luis Andres Yebra

Networks, 2011

2008

The Simulation Course: An Innovative Way of Teaching Computational Science in Aeronautics.

Ricard González-Cinca, Eduard Santamaria, J. Luis A. Yebra

Proceedings of the Computational Science, 2008

2005

Exact Solutions for Minimax Optimization Problems.

Francesc Comellas, José Luis Andres Yebra

Am. Math. Mon., 2005

2002

On spectral bounds for cutsets.

Juan A. Rodríguez-Velázáuez, Amauri Gutiérrez, José Luis Andres Yebra

Discret. Math., 2002

New Lower Bounds for Heilbronn Numbers.

Francesc Comellas, J. Luis A. Yebra

Electron. J. Comb., 2002

Laplacian Eigenvalues and the Excess of a Graph.

Juan A. Rodríguez-Velázáuez, J. Luis A. Yebra

Ars Comb., 2002

2001

Boundary graphs: The limit case of a spectral property.

Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra

Discret. Math., 2001

2000

On Twisted Odd Graphs.

Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra

Comb. Probab. Comput., 2000

1999

Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods.

Juan A. Rodríguez-Velázáuez, José Luis Andres Yebra

Discret. Math., 1999

1998

From regular boundary graphs to antipodal distance-regular graphs.

Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra

J. Graph Theory, 1998

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

Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra

Discret. Math., 1998

1997

The vulnerability of the diameter of folded n-cubes.

Ester Simó, José Luis Andres Yebra

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

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, Ser. B, 1996

Locally Pseudo-Distance-Regular Graphs.

Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra

J. Comb. Theory, Ser. B, 1996

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

1992

Graphs on Alphabets as Models for Large Interconnection Networks.

José Gómez, Miguel Angel Fiol, J. Luis A. Yebra

Discret. Appl. Math., 1992

1991

The (Δ, <i>d, d′</i>, Δ - 1)-problem with applications to computer networks.

J. Luis A. Yebra, Victor J. Rayward-Smith, A. P. Revitt

Ann. Oper. Res., 1991

1990

Dense bipartite digraphs.

Miguel Angel Fiol, José Luis Andres Yebra

J. Graph Theory, 1990

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

1986

Some large graphs with given degree and diameter.

Ignacio Alegre, Miguel Angel Fiol, J. Luis A. Yebra

J. Graph Theory, 1986

1984

Line Digraph Iterations and the (<i>d, k</i>) Digraph Problem.

Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel

IEEE Trans. Computers, 1984

1983

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

Miguel Angel Fiol, Ignacio Alegre, J. Luis A. Yebra

Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983