Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 31 May 2025 in math.CO | (2506.00414v1)

Abstract: Let $G$ be a graph of order $ n(G) $, local metric dimension $ \dim_l(G) $, and clique number $ \omega(G) $. It has been conjectured that if $ n(G) \geq \omega(G) + 1 \geq 4 $, then $ \dim_l(G) \leq \left( \frac{\omega(G) - 2}{\omega(G) - 1} \right) n(G) $. In this paper the conjecture is confirmed for the case $ \omega(G) = 3 $. Consequently, a problem regarding the local metric dimension of planar graphs is also resolved.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.