For given integer n and D, what is the minimum number of edges in a graph on n vertices with the property that after deleting any edge, the remaining graph has diameter no more than D? This problem was first proposed by Murty and Vijayan in 1964. In this paper an exact solution for this problem is given for general n and D.
