radius ,diameter of graph

Question

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.

Answer 1

For k6 both diameter and radius would be 1 all vertices are connected with each other

For k4,5 both radius and diameter will be 2 as vertices in the same partition separated by atmost 2

For hypercube that is Q3 both will be 3 equal to n

For cycle C6 radius and diameter will be equal to n/2 that is 3