On the local metric dimension of K5-free graphs
Abstract
Let \( G \) be a graph with order \( n(G) ≥ 5 \), local metric dimension \( l(G) \), and clique number \( ω(G) \). In this paper, we investigate the local metric dimension of \( K5 \)-free graphs and prove that \( l(G) ≤ 23n(G) \) when \( ω(G) = 4 \). As a consequence of this finding, along with previous publications, we establish that if \( G \) is a \( K5 \)-free graph, then \( l(G) ≤ 25n(G) \) when \( ω(G) = 2 \), \( l(G) ≤ 12n(G) \) when \( ω(G) = 3 \), and \( l(G) ≤ 23n(G) \) when \( ω(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) + 1 ≥ 4 \), then \( l(G) ≤ ( ω(G) - 2ω(G) - 1 )n(G) \).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.