English

On the local metric dimension of $K_5$-free graphs

Combinatorics 2025-11-18 v2

Abstract

Let G G be a graph with order n(G)5 n(G) \geq 5 , local metric dimension diml(G) \dim_l(G) , and clique number ω(G) \omega(G) . In this paper, we investigate the local metric dimension of K5 K_5 -free graphs and prove that diml(G)23n(G) \dim_l(G) \leq \lfloor\frac{2}{3}n(G)\rfloor when ω(G)=4 \omega(G) = 4 . As a consequence of this finding, along with previous publications, we establish that if G G is a K5 K_5 -free graph, then diml(G)25n(G) \dim_l(G) \leq \lfloor\frac{2}{5}n(G)\rfloor when ω(G)=2 \omega(G) = 2 , diml(G)12n(G) \dim_l(G) \leq \lfloor\frac{1}{2}n(G)\rfloor when ω(G)=3 \omega(G) = 3 , and diml(G)23n(G) \dim_l(G) \leq \lfloor\frac{2}{3}n(G)\rfloor when ω(G)=4 \omega(G) = 4 . Notably, these bounds are sharp for planar graphs. These results for graphs with a clique number less than or equal to 4 provide a positive answer to the conjecture stating that if n(G)ω(G)+14 n(G) \geq \omega(G) + 1 \geq 4 , then diml(G)(ω(G)2ω(G)1)n(G) \dim_l(G) \leq \left( \frac{\omega(G) - 2}{\omega(G) - 1} \right)n(G) .

Keywords

Cite

@article{arxiv.2507.13752,
  title  = {On the local metric dimension of $K_5$-free graphs},
  author = {Ali Ghalavand and Xueliang Li},
  journal= {arXiv preprint arXiv:2507.13752},
  year   = {2025}
}