Clique graphs of chordal and path graphs are characterized. A special
class of graphs named expanded trees is discussed. It consists of a su
bclass of disk-Helly graphs. It is shown that the clique graph of ever
y chordal (hence path) graph is an expanded tree. In addition, every e
xpanded tree is the clique graph of some path (hence chordal) graph. D
ifferent characterizations of expanded trees are described, leading to
a polynomial time algorithm for recognizing them.