Resolvability in graphs and the metric dimension of a graph
From MaRDI portal
DOI10.1016/S0166-218X(00)00198-0zbMATH Open0958.05042DBLPjournals/dam/ChartrandEJO00WikidataQ56551548 ScholiaQ56551548MaRDI QIDQ1582071FDOQ1582071
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)
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- On metric dimension of graphs and their complements
- On fractional metric dimension of graphs
- On strong metric dimension of graphs and their complements
- The partition dimension of strong product graphs and Cartesian product graphs
- On the strong partition dimension of graphs
- On the metric dimension of two families of convex polytopes
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Strong resolving partitions for strong product graphs and Cartesian product graphs
- On families of convex polytopes with constant metric dimension
- Metric dimension of some distance-regular graphs
- The metric dimension of metric spaces
- On the metric dimension of circulant graphs
- Title not available (Why is that?)
- A linear time algorithm for metric dimension of cactus block graphs
- Computing the metric dimension of wheel related graphs
- \(k\)-metric resolvability in graphs
- Simultaneous resolvability in graph families
- On the strong metric dimension of Cartesian and direct products of graphs
- Approximation complexity of metric dimension problem
- On the commuting graph of semidihedral group
- Uniquely identifying the edges of a graph: the edge metric dimension
- A note on the partition dimension of Cartesian product graphs
- A characterization of some graphs with metric dimension two
- On the metric dimension of corona product graphs
- Determining sets, resolving sets, and the exchange property
- On the local metric dimension of corona product graphs
- The \(k\)-metric dimension of corona product graphs
- The metric dimension of the lexicographic product of graphs
- On the metric dimension of circulant and Harary graphs
- The difference between the metric dimension and the determining number of a graph
- Resolving-power dominating sets
- Mixed metric dimension of graphs
- On the metric dimension of infinite graphs
- Destroying automorphisms by fixing nodes
- Conditional resolvability in graphs: a survey
- The strong metric dimension of graphs and digraphs
- Resolvability and the upper dimension of graphs
- Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
- Distance-based vertex identification in graphs: the outer multiset dimension
- On zero forcing number of graphs and their complements
- On the fractional strong metric dimension of graphs
- Complexity of metric dimension on planar graphs
- Asymptotic behavior of the edge metric dimension of the random graph
- The fractional metric dimension of graphs
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- The (weighted) metric dimension of graphs: hard and easy cases
- The fractional \(k\)-truncated metric dimension of graphs
- Partition dimension of rooted product graphs
- The metric dimension of Cartesian products of graphs
- On the metric dimension of infinite graphs
- Discrepancies between metric dimension and partition dimension of a connected graph
- The metric dimension of Cayley digraphs
- On the strong metric dimension of corona product graphs and join graphs
- On the partition dimension of trees
- Resolvability of Hamming graphs
- Resolving the hypercube
- On the k-metric dimension of metric spaces
- Strong metric dimension of rooted product graphs
- Nordhaus-Gaddum bounds for locating domination
- Computing the \(k\)-metric dimension of graphs
- On the metric dimension of some families of graphs
- The fractional strong metric dimension of graphs
- Metric dimension of bounded width graphs
- The simultaneous metric dimension of graph families
- Locating a robber on a graph via distance queries
- The fractional metric dimension of permutation graphs
- Metric dimension of maximal outerplanar graphs
- Computing the metric dimension for chain graphs
- Completeness-resolvable graphs
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- The metric dimension and girth of graphs
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Locating and total dominating sets in trees
- The metric dimension and metric independence of a graph
- Bounds on the domination number and the metric dimension of co-normal product of graphs
- On the metric dimension of generalized tensor product of interval with paths and cycles
- A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs
- Extremal Graph Theory for Metric Dimension and Diameter
- Graphs of maximum and minimum order with fixed metric dimension and diameter
- Vertex and edge metric dimensions of unicyclic graphs
- On the locatic number of graphs
- On some plane graphs and their metric dimension
- Conditional resolvability of honeycomb and hexagonal networks
- Sharp bounds for partition dimension of generalized Möbius ladders
- Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
- On the power graphs of certain finite groups
- On the metric dimensions for sets of vertices
- On randomly \(k\)-dimensional graphs
- Metric dimension of Cayley digraphs of split metacyclic groups
- On the commuting graph of dihedral group
- Extremal results for graphs of bounded metric dimension
- The simultaneous strong metric dimension of graph families
- Metric dimension of directed graphs
- Computing the metric dimension of graphs by genetic algorithms
- On the metric dimension of the folded \(n\)-cube
- Locating and paired-dominating sets in graphs
- Computing minimal doubly resolving sets of graphs
- On lower bounds for the metric dimension of graphs
- On graphs with same metric and upper dimension
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)
