Interplay between the local metric dimension and the clique number of a graph

The local metric dimension ${\mathrm{d}\mathrm{i}\mathrm{m}}_l$ in relation to the clique number $\omega$ is investigated. It is proved that if $\omega (G)\le n(G)-3$, then ${\mathrm{d}\mathrm{i}\mathrm{m}}_l(G)\le n(G)-3$ and the graphs attaining the bound classified. Moreover, the graphs $G$ with ${\mathrm{d}\mathrm{i}\mathrm{m}}_l(G)=n(G)-3$ are listed (with no condition on the clique number). It is proved that if $\omega (G)=n(G)-2$, then $n(G)-4\le {\mathrm{d}\mathrm{i}\mathrm{m}}_l(G)\le n(G)-3$, and all graphs are divided into two groups depending on which of the options applies. The conjecture asserting that for any graph $G$ we have ${\mathrm{d}\mathrm{i}\mathrm{m}}_l(G)\le [(\omega (G)-2)\mathrm{/}(\omega (G)-1)]\cdot n(G)$ is proved for all graphs with $\omega (G)\in \{n(G)-1,n(G)-2,n(G)-3\}$. A negative answer is given for the problem whether every planar graph fulfills the inequality ${\mathrm{d}\mathrm{i}\mathrm{m}}_l(G)\le \lceil (n(G)+1)\mathrm{/}2\rceil$.