On the local metric dimension of $K_5$-free graphs
Combinatorics
2025-11-18 v2
Abstract
Let be a graph with order , local metric dimension , and clique number . In this paper, we investigate the local metric dimension of -free graphs and prove that when . As a consequence of this finding, along with previous publications, we establish that if is a -free graph, then when , when , and when . 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 , then .
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}
}