On minimum metric dimension of honeycomb networks

DOI10.1016/j.jda.2006.09.002zbMath1159.05308OpenAlexW2015569852MaRDI QIDQ954950

Rajan Bharati, Indra Rajasingh, Chris Monica M, Paul D. Manuel

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.09.002

zbMATH Keywords

metric dimensionhexagonal networkhoneycomb networkmetric basisdual of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (31)

Computation of topological indices of certain networks ⋮ On the metric dimension of circulant and Harary graphs ⋮ On the bounded partition dimension of some classes of convex polytopes ⋮ Unnamed Item ⋮ Vertex-bipancyclicity of the generalized honeycomb tori ⋮ Metric dimension of directed graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Computing topological indices of sudoku graphs ⋮ Unnamed Item ⋮ On metric dimension of subdivided honeycomb network and Aztec diamond network ⋮ Fault-tolerant strong metric dimension of graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Unnamed Item ⋮ On metric dimensions of symmetric graphs obtained by rooted product ⋮ Locating Number of Biswapped Networks ⋮ The fault‐tolerant beacon set of hexagonal Möbius ladder network ⋮ Erdös-Gallai-type problems for distance-edge-monitoring numbers ⋮ Unnamed Item ⋮ On the metric dimension of HDN ⋮ Radial radio number of hexagonal and its derived networks ⋮ Conditional resolvability of honeycomb and hexagonal networks ⋮ On the \(k\)-partition dimension of graphs ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ Computation of edge resolvability of benzenoid tripod structure ⋮ The locating number of hexagonal Möbius ladder network ⋮ Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs ⋮ Routing algorithms in honeycomb meshes ⋮ On the fault-tolerant metric dimension of certain interconnection networks ⋮ Computing the metric dimension of gear graphs ⋮ Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes ⋮ On some plane graphs and their metric dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher dimensional hexagonal networks
• Landmarks in graphs
• Landmarks in torus networks
• Metric bases in digital geometry

This page was built for publication: On minimum metric dimension of honeycomb networks