Spanning trees with small diameters

Figures & data

Fig. 1 A connected graph $G$ that has no spanning tree with diameter at most $d$ and satisfies $\delta \left(G\right)=3\left|G\right|∕(d+2)-1$, where every $H_i$ is a complete graph of order $n$.