Inverse of the distance matrix of a cycle–clique graph

A connected graph G, all of whose blocks are cycles or cliques, is called a cycle–clique graph. Let D be the distance matrix of G  . By a theorem of Graham et al., we have det(D)≠0det(D)≠0 if all cycle blocks have odd vertices. In this paper we give the formula for the inverse of D.