Ghalavand–Klavžar–Li local metric dimension bound by clique number

From papers

Let GG be a graph, with order n(G)n(G) and clique number ω(G)\omega(G). Assume

n(G)ω(G)+14.n(G)\geq \omega(G)+1\geq 4.

Ghalavand's conjecture. The local metric dimension of GG satisfies

diml(G)(ω(G)2ω(G)1)n(G).\dim_l(G)\leq \left(\frac{\omega(G)-2}{\omega(G)-1}\right)n(G).

This conjecture relates the local metric dimension to the clique number. The paper proves the bound for graphs with ω(G){n(G)1,n(G)2,n(G)3}\omega(G)\in\{n(G)-1,n(G)-2,n(G)-3\}; the general case is not resolved here.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ali Ghalavand, Sandi Klavžar and Xueliang Li, “Interplay between the local metric dimension and the clique number of a graph”, arXiv:2412.17074 (2024).

Solutions 0

No solutions have been posted yet.