On the 2-metric resolvability of graphs
From MaRDI portal
Publication:2132227
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?)
- scientific article; zbMATH DE number 2068163 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Computing the \(k\)-metric dimension of graphs
- Families of regular graphs with constant metric dimension
- Fault-tolerance in resolvability
- Fault-tolerant locating-dominating sets
- Fault-tolerant metric dimension of graphs
- Irregularity measures for metal-organic networks
- Landmarks in graphs
- Minimum Fault-Tolerant, local and strong metric dimension of graphs
- On the fault-tolerant metric dimension of convex polytopes
- On the metric dimension of Möbius ladders.
- Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs
- Stacked book graphs are cycle-antimagic
- The \(k\)-metric dimension of corona product graphs
- The \(k\)-metric dimension of the lexicographic product of graphs
- The metric dimension of circulant graphs and Cayley hypergraphs
- \(k\)-metric resolvability in graphs
This page was built for publication: On the 2-metric resolvability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2132227)