The solid-metric dimension
From MaRDI portal
Recommendations
Cites work
- k-metric resolvability in graphs
- A decomposition theorem for partially ordered sets
- Boundary vertices in graphs
- Domination and location in acyclic graphs
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- Landmarks in graphs
- On {ℓ}-Metric Dimensions in Graphs
- On a new class of identifying codes in graphs
- On Metric Generators of Graphs
- On regular and new types of codes for location-domination
- On the Metric Dimension of Cartesian Products of Graphs
- Resolvability in graphs and the metric dimension of a graph
- Some structural, metric and convex properties of the boundary of a graph
- The Dilworth Number of a Graph
- The metric dimension for resolving several objects
Cited in
(7)- On the metric dimensions for sets of vertices
- On vertices contained in all or in no metric basis
- On the geodesic identification of vertices in convex plane graphs
- The metric nature of matter
- New Computational Paradigms
- On metric dimensions of hypercubes
- On a tight bound for the maximum number of vertices that belong to every metric basis
This page was built for publication: The solid-metric dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285129)