On metric dimension of some planar graphs with 2n odd sided faces
From MaRDI portal
Publication:6542932
Recommendations
Cites work
- 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 3639144 (Why is no real title available?)
- Computing a metric basis of a bipartite distance-hereditary graph
- Computing the metric dimension of a graph from primary subgraphs
- Computing vertex resolvability of some regular planar graphs
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
- Landmarks in graphs
- Metric bases in digital geometry
- Metric dimension of heptagonal circular ladder
- On metric dimension of plane graphs $\mathfrak{J}_{n}$, $\mathfrak{K}_{n}$ and $\mathfrak{L}_{n}$
- On some plane graphs and their metric dimension
- On the metric dimension of Grassmann graphs
- Resolvability in graphs and the metric dimension of a graph
- The independent resolving number of a graph
This page was built for publication: On metric dimension of some planar graphs with \(2n\) odd sided faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542932)