## Graph theory degree

Prove that if G is a graph of order n such that $\delta(G) + \Delta (G) \geq (n-1)$ then G is connected and diam(G) $\leq$ 4
This question from Book (Introduction of graph theory Zhang and Chartrand