论文信息 - On large (Delta, D)-graphs

On large (Delta, D)-graphs

Abstract This paper deals with some new constructions of large ( Δ , D )-graphs, i.e. graphs with (maximum) degree Δ , diameter D and number of vertices as large as possible. The constructions presented here are based on the compound graph technique and on expansions of Moore bipartite graphs, and they give rise to some of the largest known graphs.

Miguel Angel Fiol | Oriol Serra | J. Gómez

[1] Charles Delorme,et al. Large bipartite graphs with given degree and diameter , 1985, J. Graph Theory.

[2] Reuven Bar-Yehuda,et al. Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks , 1992, Discret. Appl. Math..

[3] Charles Delorme,et al. Large graphs with given degree and diameter. II , 1984, J. Comb. Theory, Ser. B.

[4] Charles Delorme,et al. Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[5] José Gómez Martí. Diámetro y vulnerabilidad en redes de interconexión , 1987 .

[6] Jean-Jacques Quisquater,et al. Structures d'interconnexion : constructions et applications , 1987 .

[7] Bohdan Zelinka. On a problem of a. kotzig concerning factorizations of 4-regular graphs , 1984, J. Graph Theory.

[8] Miquel Àngel Fiol Mora,et al. Algunos grafos compuestos , 1983 .

[9] Charles Delorme,et al. Grands Graphes de Degré et Diamètre Donnés , 1985, Eur. J. Comb..