SIZE OF GRAPHS AND DIGRAPHS WITH GIVEN DIAMETER AND CONNECTIVITY CONSTRAINTS

We determine the maximum size of a graph of given order, diameter, and edge-connectivity lambda for 2 <= lambda <= 7. This completes the determination of the maximum size of graphs with given order, diameter and edge-connectivity lambda which had previously been done for lambda = 1 and lambda >= 8. We further prove that upper bounds on the size of a graph of given order and diameter having certain additional properties can be extended to Eulerian digraphs, provided the additional properties satisfy some mild conditions. As an application of this result we prove that upper bounds on the size of graphs with given order, diameter and either edge-connectivity, connectivity, or minimum degree can be extended to Eulerian digraphs.