Comparing the metric and strong dimensions of graphs
type: Item
instance of: scholarly article
title: Comparing the metric and strong dimensions of graphs
zbMATH Open document ID: 1355.05100
author: Gaia Moravcik
author: Ortrud R. Oellermann
author: Samuel Yusim
published in: Discrete Applied Mathematics
publication date: 2017-02-06T00:00:00Z
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6680973
zbMATH Keywords: metric dimension
zbMATH Keywords: strong dimension
zbMATH Keywords: trees
zbMATH Keywords: cographs
zbMATH Keywords: bounds
zbMATH Keywords: algorithms
zbMATH Keywords: complexity
zbMATH Keywords: extremal results
zbMATH Keywords: split graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2016.12.020
OpenAlex ID: W2578469740
cites work: The Pathwidth and Treewidth of Cographs
cites work: Graph Classes: A Survey
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: Q3065457
cites work: Complement reducible graphs
cites work: The (weighted) metric dimension of graphs: hard and easy cases
cites work: Q4198056
cites work: Completely separable graphs
cites work: Q4119237
cites work: On the metric dimension of some families of graphs
cites work: The Fractional Strong Metric Dimension of Graphs
cites work: Landmarks in graphs
cites work: Q3089290
cites work: Q4855426
cites work: The strong metric dimension of graphs and digraphs
cites work: On the strong metric dimension of Cartesian and direct products of graphs
cites work: On Metric Generators of Graphs
cites work: Q4075485
DOI: 10.1016/J.DAM.2016.12.020
description: scientific article; zbMATH DE number 6680973