Sketch: Let ( ) and ( ) vertices in the graph. Then ( ) is adjacent to ( ). Continuing we have that a path of length d exists from ( ) to ( ). Thus the minimum eccentricity of a vertex is d. But note that we can do this for any pair so the max eccentricity is d as well. It follows that the diameter is d.