Question Distance in graphs (02). The distance d(v, w) between two vertices v and w in an undirected graph is defined as the minimal length of any path connecting these two vertices. If v and w are...

Extracted text: Question Distance in graphs (02). The distance d(v, w) between two vertices v and w in an undirected graph is defined as the minimal length of any path connecting these two vertices. If v and w are not connected, then d(v, w) = o. Now, define the diameter of the graph G = (V, E) as diam(G) = max d(v, w). v, wEV And define the radius of the graph as rad(G) = min max d(v, w) vEV wEV Prove that rad(G) < diam(g)=""><>