Large graphs with given degree and diameter. II (Q793749): Difference between revisions

[For part I cf. Ann. Discrete Math. 17, 65-73 (1983; Zbl 0527.05041; for part III cf. Ann. Discrete Math. 13, 23-31 (1982; Zbl 0495.05037).] The (\(\Delta\),D) graph problem consists of finding the maximum number of vertices of a graph with a given maximum degree \(\Delta\) and diameter D. The authors define a new product of graphs concept. Using this they construct graphs of a given maximum degree and diameter having a number of vertices larger than the largest known values.