On the radius and diameter of the clique graph
The clique graph \(K\) of a graph \(G\) is the intersection graph of all maximal cliques of \(G\). It is shown that the diameter and the radius of \(K\) and \(G\) can differ by at most 1. A full characterization is given of graphs corresponding to each of these cases.
scientific article; zbMATH DE number 858066