Computing vertex resolvability of some regular planar graphs
From MaRDI portal
Publication:6132231
DOI10.1142/S1793830922500860zbMATH Open1516.05057OpenAlexW4223998258MaRDI QIDQ6132231FDOQ6132231
Authors: S. K. Sharma, V. K. Bhat
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500860
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
- 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
- Resolvability in graphs and the metric dimension of a graph
- On classes of regular graphs with constant metric dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the metric dimension of Grassmann graphs
- Landmarks in graphs
- Families of regular graphs with constant metric dimension
- Metric bases in digital geometry
- Resolving domination in graphs
- The independent resolving number of a graph
- A characterization of some graphs with metric dimension two
- Computing the metric dimension of a graph from primary subgraphs
- On graphs with same metric and upper dimension
- On some plane graphs and their metric dimension
- Structures of Domination in Graphs
- Fault-tolerant resolvability in some classes of line graphs
- Computation of the double metric dimension in convex polytopes
- Computing edge version of metric and double metric dimensions of Kayak paddle graphs
- Metric dimension of heptagonal circular ladder
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
- The metric dimension & distance spectrum of non-commuting graph of dihedral group
- On metric dimension of plane graphs $\mathfrak{J}_{n}$, $\mathfrak{K}_{n}$ and $\mathfrak{L}_{n}$
- On the metric dimension and diameter of circulant graphs with three jumps
Cited In (1)
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)