Comparing the metric and strong dimensions of graphs

DOI10.1016/J.DAM.2016.12.020zbMath1355.05100OpenAlexW2578469740MaRDI QIDQ507581

Ortrud R. Oellermann, Gaia Moravcik, Samuel Yusim

Publication date: 6 February 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.020

zbMATH Keywords

complexityalgorithmsboundstreescographssplit graphsmetric dimensionextremal resultsstrong dimension

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (1)

Metric properties of generalized Sierpiński graphs over stars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the strong metric dimension of Cartesian and direct products of graphs
• The (weighted) metric dimension of graphs: hard and easy cases
• The strong metric dimension of graphs and digraphs
• Completely separable graphs
• Complement reducible graphs
• Resolvability in graphs and the metric dimension of a graph
• Landmarks in graphs
• The Fractional Strong Metric Dimension of Graphs
• On the metric dimension of some families of graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Graph Classes: A Survey
• The Pathwidth and Treewidth of Cographs
• On Metric Generators of Graphs

This page was built for publication: Comparing the metric and strong dimensions of graphs