Prove that if G is a graph of order n such that then G is connected and diam(G) 4

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

Printable View

- Mar 8th 2012, 07:00 AMAmerGraph theory degree
Prove that if G is a graph of order n such that then G is connected and diam(G) 4

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