Resolving vertices of graphs with differences
From MaRDI portal
Publication:6569070
Recommendations
Cites work
- A note on \(k\)-metric dimensional graphs
- Extremal results for graphs of bounded metric dimension
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Learning to compute the metric dimension of graphs
- Metric dimension of maximal outerplanar graphs
- Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
- Mixed metric dimension of graphs
- On the robustness of the metric dimension of grid graphs to adding a single edge
- On vertices contained in all or in no metric basis
- Some binary products and integer linear programming for \(k\)-metric dimension of graphs
- The local metric dimension of a graph
- Uniquely identifying the edges of a graph: the edge metric dimension
Cited in
(3)
This page was built for publication: Resolving vertices of graphs with differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569070)