The distance between two distinct vertices v1 and v2 of a
connected simple graph is the length (number of edges) of
the shortest path between v1 and v2. The radius of a graph
is the minimum over all vertices v of the maximum distance
from v to another vertex. The diameter of a graph
is the maximum distance between two distinct vertices.
Find the radius and diameter of
a) K6. b) K4,5. c) Q3. d) C6.