New resolvability parameters of graphs
From MaRDI portal
Recommendations
Cites work
- Different-distance sets in a graph
- 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 2068163 (Why is no real title available?)
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- The 2-dimension of a tree
- The metric dimension and metric independence of a graph
Cited in
(11)- Resolvability and the upper dimension of graphs
- Conditional resolvability in graphs: a survey
- The \(k\)-size edge metric dimension of graphs
- A new parameter on resolving sets with a realizable triple
- scientific article; zbMATH DE number 2156795 (Why is no real title available?)
- Total resolving number of edge cycle graphs
- Weak total resolving sets in graphs
- The 2-dimension of a tree
- Vertex-based resolvability parameters for some families of convex polytopes
- Maximal resolving sets in a graph
- Weak total resolvability in graphs
This page was built for publication: New resolvability parameters of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956222)