k-metric resolvability in graphs
From MaRDI portal
Publication:283685
DOI10.1016/J.ENDM.2014.08.017zbMATH Open1337.05029OpenAlexW1998020586WikidataQ57974271 ScholiaQ57974271MaRDI QIDQ283685FDOQ283685
Authors: Alejandro Estrada-Moreno, Ismael G. Yero, Juan A. Rodríguez-Velázquez 
Publication date: 13 May 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2014.08.017
Recommendations
Cites Work
- Resolvability in graphs and the metric dimension of a graph
- Resolvability and the upper dimension of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the strong metric dimension of corona product graphs and join graphs
- The local metric dimension of a graph
- Title not available (Why is that?)
- Resolving domination in graphs
- On Metric Generators of Graphs
- The \(k\)-metric dimension of corona product graphs
- The strong metric dimension of graphs and digraphs
Cited In (12)
- The weighted 2-metric dimension of trees in the non-landmarks model
- The solid-metric dimension
- On randomly \(k\)-dimensional graphs
- On the 2-metric resolvability of graphs
- The \(k\)-metric dimension of corona product graphs
- The \(k\)-metric dimension
- Sharp bound on the truncated metric dimension of trees
- Resolving sets tolerant to failures in three-dimensional grids
- On the k-metric dimension of metric spaces
- On the chromatic dimension of a graph
- Computing the \(k\)-metric dimension of graphs
- On the \(k\)-partition dimension of graphs
This page was built for publication: \(k\)-metric resolvability in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283685)
