On metric dimension of some planar graphs with \(2n\) odd sided faces

DOI10.1142/s1793830922501853zbMATH Open1537.05005MaRDI QIDQ6542932

Sunny Kumar Sharma, Pradeep Singh, Vijay Kumar Bhat

Publication date: 23 May 2024

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

planar graphsindependent setresolving setmetric dimensionmetric basis

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
• Computing the metric dimension of a graph from primary subgraphs
• Resolvability in graphs and the metric dimension of a graph
• Computing a metric basis of a bipartite distance-hereditary graph
• 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
• The independent resolving number of a graph
• On the metric dimension of Grassmann graphs
• Metric dimension of heptagonal circular ladder
• Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
• Computing vertex resolvability of some regular planar graphs

Related Items (1)

On the local metric dimension of generalized wheel graph

This page was built for publication: On metric dimension of some planar graphs with \(2n\) odd sided faces