On the radius and diameter of the clique graph

In 1986 Peyrat, Rall and Slater established a characterization of graphs G for which the diameter of the clique graph d(K) is exactly d(G) + 1. We extend their result by characterizing those conditions which lead to all possible values for the radius and diameter of the clique graph of G in terms of the corresponding values for G.