On the metric dimension of two families of convex polytopes
From MaRDI portal
Publication:258375
DOI10.1007/S13370-015-0336-5zbMath1337.05032OpenAlexW2140740222WikidataQ59438411 ScholiaQ59438411MaRDI QIDQ258375
F. Blanchet-Sadri, M. Dambrine
Publication date: 10 March 2016
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-015-0336-5
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Connectivity (05C40) General convexity (52A99)
Related Items (2)
Matching numbers in fuzzy graphs ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On classes of regular graphs with constant metric dimension
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- On families of convex polytopes with constant metric dimension
- Resolvability in graphs and the metric dimension of a graph
- On the metric dimension of some families of graphs
- On the Metric Dimension of Cartesian Products of Graphs
This page was built for publication: On the metric dimension of two families of convex polytopes