Extremal graphs of diameter 4

The object of this paper is to determine the minimum possible number of edges for a graph of order n and diameter at most four having the property that by suppressing any vertex the subgraph obtained has diameter at most λ ≥ 4. Results for λ ≥ 6 will be proved.