The number of graphs of given diameter
Abstract
In this paper it is proved that there are constants 0< c2< c1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever n tends to infinity and 2 < d < n - c1 (log n). A typical graph of diameter d consists of a combination of an induced path of length d and a highly connected block of size n-d+3. In the case d > n- c2(log n) another asymptotic formula is calculated and the typical graph has a completely different snakelike structure.
0