For a complete bipartite graph Kn, every pair of vertices are adjacent. So the diameter and radius both 1.
For a complete bipartite graph Km,n you need tow steps to reach any vertex, so the radius and diameter are both 2.
Exception if (m or n =1); in this case a single vertex can reach another vertex in 1 step, so the radius is 1.