Prove that if G is a graph of order n such that $\displaystyle \delta(G) + \Delta (G) \geq (n-1) $ then G is connected and diam(G) $\displaystyle \leq $ 4

This question from Book (Introduction of graph theory Zhang and Chartrand

Printable View

- Mar 8th 2012, 06:00 AMAmerGraph theory degree
Prove that if G is a graph of order n such that $\displaystyle \delta(G) + \Delta (G) \geq (n-1) $ then G is connected and diam(G) $\displaystyle \leq $ 4

This question from Book (Introduction of graph theory Zhang and Chartrand