Computing vertex resolvability of some regular planar graphs

DOI10.1142/s1793830922500860zbMath1516.05057OpenAlexW4223998258MaRDI QIDQ6132231

Sunny Kumar Sharma, Vijay Kumar 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

zbMATH Keywords

convex polytopesmetric dimensionlocating setmetric basispendant edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On classes of regular graphs with constant metric dimension
• Computing the metric dimension of a graph from primary subgraphs
• Resolvability in graphs and the metric dimension of a graph
• Fault-tolerant resolvability in some classes of line graphs
• Computation of the double metric dimension in convex polytopes
• On some plane graphs and their metric dimension
• Landmarks in graphs
• On metric dimension of plane graphs $\mathfrak{J}_{n}$, $\mathfrak{K}_{n}$ and $\mathfrak{L}_{n}$
• Metric bases in digital geometry
• On the metric dimension and diameter of circulant graphs with three jumps
• Resolving domination in graphs
• The independent resolving number of a graph
• On graphs with same metric and upper dimension
• The metric dimension & distance spectrum of non-commuting graph of dihedral group
• Structures of Domination in Graphs
• A characterization of some graphs with metric dimension two
• On the metric dimension of Grassmann graphs
• 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