Grands Graphes de Degré et Diamètre Donnés

We give some constructions of graphs with given degree and diameter, having a large number of vertices. The recipes given here involve incidence graphs of generalized quadrangles and hexagons.

[1]  R. Singleton.  On Minimal graphs of maximum even girth , 1966 .

[2]  R. M. Storwick,et al.  Improved Construction Techniques for (d, k) Graphs , 1970, IEEE Transactions on Computers.

[3]  Mark A. Ronan,et al.  A geometric characterization of Moufang hexagons , 1980 .

[4]  Jacobus H. van Lint,et al.  Directed graphs with unique paths of fixed length , 1978, J. Comb. Theory, Ser. B.

[5]  G. Farhi,et al.  Large Graphs with Given Degree and Diameter III , 1982 .

[6]  Joseph A. Thas,et al.  Polar Spaces, Generalized Hexagons and Perfect Codes , 1980, J. Comb. Theory A.

[7]  C. T. Benson.  Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.

[8]  Clement W. H. Lam,et al.  On Some Solutions of Ak = dl + lambda J , 1977, J. Comb. Theory, Ser. A.

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

[10]  Marvin H. Solomon,et al.  High Density Graphs for Processor Interconnection , 1981, Inf. Process. Lett..

[11]  Charles Delorme,et al.  Large Graphs with Given Degree and Diameter - Part I , 1984, IEEE Trans. Computers.

[12]  Stanley E. Payne,et al.  Affine representations of generalized quadrangles , 1970 .

[13]  Gérard Memmi,et al.  Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.

[14]  N. Biggs.  Algebraic Graph Theory , 1974 .

[15]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[16]  A. Yanushka,et al.  On order in generalized polygons , 1981 .