On clique-gated graphs (Q1297444)

A graph \(G\) is called clique-gated, if for any clique \(Q\) in \(G\) and any vertex \(v\) there exists just one vertex of \(Q\) whose distance from \(v\) is smaller than the distance from \(v\) to any other vertex of \(Q\). The author answers confirmatively the question whether a clique-gated graph can include any induced \(C_5\). Moreover, he found a subgraph on 15 vertices that is included as a subgraph into any clique-gated graph.