On a conjecture about the local metric dimension of graphs (Q2111072)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a conjecture about the local metric dimension of graphs |
scientific article; zbMATH DE number 7636970
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a conjecture about the local metric dimension of graphs |
scientific article; zbMATH DE number 7636970 |
Statements
On a conjecture about the local metric dimension of graphs (English)
0 references
23 December 2022
0 references
Let \(G\) be a graph of order \(n\) and clique number \(k\). It was conjectured in [\textit{G. Abrishami} et al., Discrete Math. 345, No. 4, Article ID 112763, 10 p. (2022; Zbl 1482.05076)] that the local metric dimension of \(G\) is bounded from the above by \(\frac{k-1}{k}n\). This article proves this conjecture. It is further proved that equality is attained precisely for complete graphs.
0 references
local metric dimension
0 references
local metric generator
0 references
clique
0 references
0 references
0 references
