On the strong metric dimension of tetrahedral diamond lattice

DOI10.1007/s11786-015-0226-0zbMath1317.05040OpenAlexW571333398MaRDI QIDQ2516507

Sudeep Stephen, Cyriac Grigorious, Paul D. Manuel, Bharathi Rajan

Publication date: 3 August 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-015-0226-0

zbMATH Keywords

metric dimensionstrong metric dimensionmetric basisstrong metric basistetrahedral diamond lattice

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the metric dimension of circulant and Harary graphs
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• A note on the partition dimension of Cartesian product graphs
• Mastermind
• The strong metric dimension of graphs and digraphs
• An efficient representation of Benes networks and its applications
• On minimum metric dimension of honeycomb networks
• Resolvability in graphs and the metric dimension of a graph
• Conditional resolvability in graphs: a survey
• The partition dimension of a graph
• On the partition dimension of a class of circulant graphs
• The partition dimension of Cayley digraphs
• Locating and total dominating sets in trees
• Landmarks in graphs
• The Metric Dimension of Regular Bipartite Graphs
• Landmarks in torus networks
• Packing Odd Circuits
• Extremal Graph Theory for Metric Dimension and Diameter
• Metric bases in digital geometry
• Structure-activity maps for visualizing the graph variables arising in drug design
• Resolving domination in graphs
• Coin-Weighing Problems
• On Metric Generators of Graphs
• The metric dimension of the lexicographic product of graphs

This page was built for publication: On the strong metric dimension of tetrahedral diamond lattice