New largest known graphs of diameter 6

In the pursuit of obtaining largest graphs of given maximum degree ∆ and diameter D, many construction techniques have been developed. Compounding of graphs is one such technique. In this paper, by means of the compounding of complete graphs into a Moore bipartite graph of diameter 6, we obtain a family of large graphs of the same diameter. For ∗Research supported in part by the Australian Research Council grant ARC DP0450294, by the Spanish Ministry of Education under the project MTM2005-08990-C02-01 and by the Catalan Research Council under the project 2005SGR00256. †g.pinedav@gmail.com ‡jgomez@ma4.upc.edu §mirka.miller@newcastle.edu.au ¶hebert.perez@gmail.com

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

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

[3]  Asif Zaman,et al.  MOORE GRAPHS OF DIAMETER 2 AND 3 , 2010 .

[4]  J. Gómez Martí,et al.  Two new families of large compound graphs , 2006, Networks.

[5]  A CanaleEduardo,et al.  Asymptotically large (Δ, D)-graphs , 2005 .

[6]  Dominique Buset,et al.  Maximal cubic graphs with diameter 4 , 2000, Discret. Appl. Math..

[7]  Mirka Miller,et al.  On graphs of maximum degree 3 and defect 4 , 2008 .

[8]  Bernard Elspas,et al.  Topological constraints on interconnection-limited logic , 1964, SWCT.

[9]  R. M. Damerell.  On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  F. Comellas,et al.  New large graphs with given degree and diameter , 1994, math/9411218.

[11]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

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

[13]  Sergey G. Molodtsov,et al.  Largest Graphs of Diameter 2 and Maximum Degree 6 , 2005, Electron. Notes Discret. Math..

[14]  Leif K. Jørgensen,et al.  Diameters of Cubic Graphs , 1992, Discret. Appl. Math..

[15]  Christoph von Conta.  Torus and Other Networks as Communication Networks With Up to Some Hundred Points , 1983, IEEE Trans. Computers.

[16]  J. Gómez Martí.  On large (Δ, 6)-Graphs , 2005 .

[17]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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

[19]  Karl W. Doty.  Large Regular Interconnection Networks , 1982, ICDCS.

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

[21]  Charles Delorme,et al.  Some New Large Compound Graphs , 2002, Eur. J. Comb..

[22]  Frank Harary,et al.  Graph Theory , 2016 .

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

[24]  Camino Balbuena,et al.  New large graphs with given degree and diameter six , 1994, Networks.

[25]  Charles Delorme,et al.  Examples of Products Giving Large Graphs with Given Degree and Diameter , 1992, Discret. Appl. Math..