\(k\)-metric resolvability in graphs

DOI10.1016/J.ENDM.2014.08.017zbMath1337.05029OpenAlexW1998020586WikidataQ57974271 ScholiaQ57974271MaRDI QIDQ283685

Ismael González Yero, Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.08.017

zbMATH Keywords

resolving setmetric dimension\(k\)-metric dimensionlocating set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (8)

On the 2-metric resolvability of graphs ⋮ Resolving sets tolerant to failures in three-dimensional grids ⋮ The \(k\)-metric dimension ⋮ Sharp bound on the truncated metric dimension of trees ⋮ The weighted 2-metric dimension of trees in the non-landmarks model ⋮ On the \(k\)-partition dimension of graphs ⋮ The solid-metric dimension ⋮ On the k-metric dimension of metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-metric dimension of corona product graphs
• The strong metric dimension of graphs and digraphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• On the strong metric dimension of corona product graphs and join graphs
• Resolving domination in graphs
• On Metric Generators of Graphs

This page was built for publication: \(k\)-metric resolvability in graphs