Diameter Constrained Minimum Spanning Graph
Minimum Diameter Spanning Subgraph is what you should be looking for. It is NP-Hard to compute even in the case of planar graphs. This paper gives a nice overview.