Creative Commons Attribution 4.0 International license
Let G be a connected simple undirected graph. A vertex w is said to strongly resolve a pair of distinct vertices u, v ∈ V(G) if either there exists an isometric path (i.e. a shortest path) from w to u that contains v, or there exists an isometric path from w to v that contains u. A subset S ⊆ V(G) is said to strongly resolve G if every pair of distinct vertices of G is strongly resolved by at least one vertex in S. In the Strong Metric Dimension problem, the input consists of a graph G and a positive integer k, and the objective is to determine whether there exists a subset S ⊆ V(G) of size at most k that strongly resolves G. In this article, we show that Strong Metric Dimension is NP-complete even on (i) graphs of diameter two, and (ii) graphs of constant pathwidth and constant feedback vertex set number.
@InProceedings{tale:LIPIcs.IPEC.2026.28,
author = {Tale, Prafullkumar},
title = {{On the Hardness of Strong Metric Dimension}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.28},
URN = {urn:nbn:de:0030-drops-282010},
doi = {10.4230/LIPIcs.IPEC.2026.28},
annote = {Keywords: Strong Metric Dimension, Constant Diameter, Constant Pathwidth, Constant Feedback Vertex Set Number, NP-hardness}
}