Edge resolving number of pentagonal circular ladder

DOI10.52846/AMI.V50I1.1644MaRDI QIDQ6966669zbMATH OpenFDO

Authors S. K. Sharma, V. K. Bhat

Publication date 27 June 2025

Published in Analele Universității din Craiova. Seria Matematică Informatică (Search for Journal in Brave)

Full work available at URL https://doi.org/10.52846/AMI.V50I1.1644

zbMATH Keywords

connected graphedge metric dimensionindependent basis setmetric dimensionpentagonal circular ladder

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites work

• Families of regular graphs with constant metric dimension
• Families of rotationally-symmetric plane graphs with constant metric dimension
• Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• Landmarks in graphs
• Metric bases in digital geometry
• Metric dimension and \(R\)-sets of connected graphs
• Metric dimension of heptagonal circular ladder
• On Metric Generators of Graphs
• On the edge dimension of a graph
• On the Metric Dimension of Cartesian Products of Graphs
• Resolvability in graphs and the metric dimension of a graph
• Resolvability of some convex polytopes
• Uniquely identifying the edges of a graph: the edge metric dimension

This page was built for publication: Edge resolving number of pentagonal circular ladder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966669)