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
- On strong metric dimension of zero-divisor graphs of rings
- The \(k\)-size edge metric dimension of graphs
- The metric dimension of some generalized Petersen graphs
- Different-distance sets in a graph
- On the metric dimension, the upper dimension and the resolving number of graphs
- The metric dimension of the enhanced power graph of a finite group
- Decision systems in rough set theory: a set operatorial perspective
- The full automorphism groups, determining sets and resolving sets of coprime graphs
- The weighted 2-metric dimension of trees in the non-landmarks model
- Fault-tolerant resolvability in some classes of line graphs
- Resolvability in subdivision of circulant networks \(C_n[1, k]\)
- On the fault-tolerant metric dimension of convex polytopes
- On the distance pattern distinguishing number of a graph
- On metric dimensions of symmetric graphs obtained by rooted product
- The metric dimension for resolving several objects
- On the fault-tolerant metric dimension of certain interconnection networks
- On the metric representation of the vertices of a graph
- Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
- On two variations of identifying codes
- On the edge metric dimension of convex polytopes and its related graphs
- Edge version of metric dimension and doubly resolving sets of the necklace graph
- Graphs with doubly resolving number 2
- On the metric dimension of barycentric subdivision of Cayley graphs \(\mathrm{Cay}(Z_{n}\oplus Z_{m})\)
- Resolving dominating partitions in graphs
- Metric and strong metric dimension in cozero-divisor graphs
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)
