k-metric resolvability in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- On Metric Generators of Graphs
- On the strong metric dimension of corona product graphs and join graphs
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- Resolving domination in graphs
- The \(k\)-metric dimension of corona product graphs
- The local metric dimension of a graph
- The strong metric dimension of graphs and digraphs
Cited in
(12)- Computing the \(k\)-metric dimension of graphs
- The solid-metric dimension
- On randomly \(k\)-dimensional graphs
- The \(k\)-metric dimension
- Sharp bound on the truncated metric dimension of trees
- On the chromatic dimension of a graph
- The \(k\)-metric dimension of corona product graphs
- On the k-metric dimension of metric spaces
- On the 2-metric resolvability of graphs
- On the \(k\)-partition dimension of graphs
- Resolving sets tolerant to failures in three-dimensional grids
- The weighted 2-metric dimension of trees in the non-landmarks model
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)