Resolvability in graphs and the metric dimension of a graph

DOI10.1016/S0166-218X(00)00198-0MaRDI QIDQ1582071zbMATH OpenDBLPWikidataFDO

Authors Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud R. Oellermann

Publication date 27 February 2001

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

zbMATH Keywords

treedistancediameterbasismetric dimensionunicyclic graphCartesian product

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Recommendations

• scientific article; zbMATH DE number 1749658
• On the metric dimension of infinite graphs
• The metric dimension of Cartesian products of graphs
• Extremal graph theory for metric dimension and diameter
• Graphs of maximum and minimum order with fixed metric dimension and diameter

Cited in

(only showing first 100 items - show all)

• Computing the \(k\)-metric dimension of graphs
• Strong metric dimension of rooted product graphs
• On the partition dimension of trees
• Asymptotic behavior of the edge metric dimension of the random graph
• The simultaneous metric dimension of graph families
• The (weighted) metric dimension of graphs: hard and easy cases
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• The fractional metric dimension of permutation graphs
• On the metric dimension of infinite graphs
• Distance-based vertex identification in graphs: the outer multiset dimension
• Mixed metric dimension of graphs
• On the strong metric dimension of Cartesian and direct products of graphs
• Determining sets, resolving sets, and the exchange property
• A linear time algorithm for metric dimension of cactus block graphs
• Computing the metric dimension of wheel related graphs
• On the metric dimension of some families of graphs
• The fractional \(k\)-truncated metric dimension of graphs
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• \(k\)-metric resolvability in graphs
• Simultaneous resolvability in graph families
• Locating and total dominating sets in trees
• The metric dimension of Cayley digraphs
• On the metric dimension of circulant graphs
• Resolvability of Hamming graphs
• On the metric dimension of infinite graphs
• On the strong metric dimension of corona product graphs and join graphs
• Metric dimension of maximal outerplanar graphs
• Strong resolving partitions for strong product graphs and Cartesian product graphs
• Locating a robber on a graph via distance queries
• On strong metric dimension of graphs and their complements
• On metric dimension of graphs and their complements
• The partition dimension of strong product graphs and Cartesian product graphs
• Destroying automorphisms by fixing nodes
• The fractional metric dimension of graphs
• Resolvability and the upper dimension of graphs
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• On the local metric dimension of corona product graphs
• The \(k\)-metric dimension of corona product graphs
• On the strong partition dimension of graphs
• Conditional resolvability in graphs: a survey
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• The strong metric dimension of graphs and digraphs
• The metric dimension and girth of graphs
• On families of convex polytopes with constant metric dimension
• Approximation complexity of metric dimension problem
• Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
• Resolving the hypercube
• On zero forcing number of graphs and their complements
• Discrepancies between metric dimension and partition dimension of a connected graph
• Nordhaus-Gaddum bounds for locating domination
• On fractional metric dimension of graphs
• On the k-metric dimension of metric spaces
• The fractional strong metric dimension of graphs
• The metric dimension of the lexicographic product of graphs
• scientific article; zbMATH DE number 2068163 (Why is no real title available?)
• A note on the partition dimension of Cartesian product graphs
• On the fractional strong metric dimension of graphs
• Partition dimension of rooted product graphs
• Complexity of metric dimension on planar graphs
• On the commuting graph of semidihedral group
• Metric dimension of some distance-regular graphs
• Metric dimension of bounded width graphs
• On the metric dimension of two families of convex polytopes
• A characterization of some graphs with metric dimension two
• On the metric dimension of corona product graphs
• The metric dimension of Cartesian products of graphs
• Uniquely identifying the edges of a graph: the edge metric dimension
• On the metric dimension of circulant and Harary graphs
• The metric dimension of metric spaces
• The difference between the metric dimension and the determining number of a graph
• Resolving-power dominating sets
• The metric dimension and metric independence of a graph
• Completeness-resolvable graphs
• Computing the metric dimension for chain graphs
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
• Metric Dimension of Bounded Tree-length Graphs
• On lower bounds for the metric dimension of graphs
• Some properties of the multiset dimension of graphs
• The determining number of a Cartesian product
• On the power graphs of certain finite groups
• On graphs with same metric and upper dimension
• On approximation algorithm for the edge metric dimension problem
• Extremal Graph Theory for Metric Dimension and Diameter
• On the commuting graph of dihedral group
• On some plane graphs and their metric dimension
• Sharp bounds for partition dimension of generalized Möbius ladders
• Locating and paired-dominating sets in graphs
• A note on the complexity of \(k\)\textsc{-metric dimension}
• Extremal results for graphs of bounded metric dimension
• On randomly \(k\)-dimensional graphs
• Metric dimension and pattern avoidance in graphs
• The twin non-commuting graph of a group
• Computing the metric dimension of graphs by genetic algorithms
• The threshold dimension of a graph
• The metric dimension of circulant graphs and their Cartesian products
• Computing minimal doubly resolving sets of graphs
• Bounds on the domination number and the metric dimension of co-normal product of graphs
• Computing metric dimension of compressed zero divisor graphs associated to rings
• On the metric dimension of generalized tensor product of interval with paths and cycles
• Conditional resolvability of honeycomb and hexagonal networks

This page was built for publication: Resolvability in graphs and the metric dimension of a graph

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