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)
- 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
- A note on the complexity of \(k\)\textsc{-metric dimension}
- Metric dimension of Andrásfai graphs
- On the number of resolving pairs in graphs
- Extending the metric dimension to graphs with missing edges
- Title not available (Why is that?)
- On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\)
- Some properties of the multiset dimension of graphs
- Metric Dimension of Bounded Tree-length Graphs
- The determining number of a Cartesian product
- Metric dimension and pattern avoidance in graphs
- The twin non-commuting graph of a group
- On approximation complexity of metric dimension problem
- The metric dimension of circulant graphs and their Cartesian products
- Vertex and edge dimension of hypergraphs
- On metric dimension of permutation graphs
- Connected Resolvability of Graphs
- Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs
- On the metric dimension of Cayley graphs
- Computing the metric dimension of a graph from primary subgraphs
- On approximation algorithm for the edge metric dimension problem
- Metric dimension and \(R\)-sets of connected graphs
- On path related graphs with constant metric dimension
- Comparing the metric and strong dimensions of graphs
- Vertices, edges, distances and metric dimension in graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
- Computing metric dimension of compressed zero divisor graphs associated to rings
- Resolvability in circulant graphs
- On the metric dimension of barycentric subdivision of Cayley graphs
- Graphs of order \(n\) with determining number \(n-3\)
- The threshold dimension of a graph
- On the edge dimension of a graph
- On the \(k\)-partition dimension of graphs
- 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
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)
