On a conjecture about the local metric dimension of graphs (Q2111072): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q122922712, #quickstatements; #temporary_batch_1712111774907 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q122922712 / rank | |||
Normal rank | |||
Revision as of 03:47, 3 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a conjecture about the local metric dimension of graphs |
scientific article |
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
