Computation of the double metric dimension in convex polytopes
From MaRDI portal
Publication:2051724
DOI10.1155/2021/9958969zbMath1477.05066OpenAlexW3208565417MaRDI QIDQ2051724
Publication date: 24 November 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/9958969
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- On families of convex polytopes with constant metric dimension
- Mastermind
- Approximation for the minimum cost doubly resolving set problem
- Computing minimal doubly resolving sets of graphs
- On \(k\)-dimensional graphs and their bases
- Resolvability in graphs and the metric dimension of a graph
- Landmarks in graphs
- Minimal doubly resolving sets of prism graphs
- The Metric Dimension of Regular Bipartite Graphs
- Computing the metric dimension of kayak paddles graph and cycles with chord
- On the Metric Dimension of Cartesian Products of Graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- On Metric Generators of Graphs
- Computing edge version of metric and double metric dimensions of Kayak paddle graphs
This page was built for publication: Computation of the double metric dimension in convex polytopes
