Comellas, F.; Gómez, J. New large graphs with given degree and diameter. (English) Zbl 0843.05033 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 221-233 (1995). Summary: We give graphs with the largest known order for a given degree \(\Delta\) and diameter \(D\). The graphs are constructed from Moore bipartite graphs by replacement of some vertices by adequate structures. The paper also contains the latest version of the \((\Delta, D)\) table for graphs.For the entire collection see [Zbl 0834.00037]. Cited in 9 Documents MSC: 05C12 Distance in graphs 05C35 Extremal problems in graph theory Keywords:degree; diameter; Moore bipartite graphs PDFBibTeX XMLCite \textit{F. Comellas} and \textit{J. Gómez}, in: Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 221--233 (1995; Zbl 0843.05033) Full Text: arXiv