A note on the complexity of \(k\)\textsc{-metric dimension}

DOI10.1016/j.amc.2023.128204arXiv2101.12018OpenAlexW3123903451MaRDI QIDQ6096304

Yannick Schmitz, Egon Wanke, Duygu Vietz

Publication date: 11 September 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.12018

zbMATH Keywords

resolving setmetric dimension\(k\)-metric dimensionmetric generator

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Theory of computing (68Qxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation complexity of metric dimension problem
• The \(k\)-metric dimension of corona product graphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• Computing the \(k\)-metric dimension of graphs
• Landmarks in graphs
• On the Complexity of Metric Dimension
• The Metric Dimension of Regular Bipartite Graphs
• On the metric dimension of some families of graphs
• Metric bases in digital geometry
• On Metric Generators of Graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: A note on the complexity of \(k\)\textsc{-metric dimension}