Computing vertex resolvability of some regular planar graphs
From MaRDI portal
Publication:6132231
Recommendations
- \(D\)-resolvability of vertices in planar graphs
- Computing planarity in computable planar graphs
- Resolvability and the upper dimension of graphs
- The vertex-edge resolvability of some wheel-related graphs
- Resolvability in circulant graphs
- scientific article; zbMATH DE number 3874609
- scientific article; zbMATH DE number 3874608
- On the Angular Resolution of Planar Graphs
- scientific article; zbMATH DE number 1998282
- Resolvability in graphs and the metric dimension of a graph
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?)
- A characterization of some graphs with metric dimension two
- Computation of the double metric dimension in convex polytopes
- Computing edge version of metric and double metric dimensions of kayak paddle graphs
- Computing the metric dimension of a graph from primary subgraphs
- Families of regular graphs with constant metric dimension
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
- Fault-tolerant resolvability in some classes of line graphs
- Landmarks in graphs
- Metric bases in digital geometry
- Metric dimension of heptagonal circular ladder
- On classes of regular graphs with constant metric dimension
- On graphs with same metric and upper dimension
- 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 and diameter of circulant graphs with three jumps
- On the metric dimension of Grassmann graphs
- Resolvability in graphs and the metric dimension of a graph
- Resolving domination in graphs
- Structures of domination in graphs
- The independent resolving number of a graph
- The metric dimension \& distance spectrum of non-commuting graph of dihedral group
Cited in
(5)- On symmetrical convex polytopes and their edge resolvability
- On local metric dimension of \((n-3)\)-regular graph
- Independent resolving number of convex polytopes
- On metric dimension of some planar graphs with \(2n\) odd sided faces
- The metric dimension of small distance-regular and strongly regular graphs
This page was built for publication: Computing vertex resolvability of some regular planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132231)
