Resolvability in graphs and the metric dimension of a graph
From MaRDI portal
Recommendations
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
- Minimum weight resolving sets of grid graphs
- Metric dimension: from graphs to oriented graphs
- The solid-metric dimension
- The local metric dimension of strong product graphs
- Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
- On the robustness of the metric dimension of grid graphs to adding a single edge
- On adjacency metric dimension of some families of graph
- On vertices contained in all or in no metric basis
- Learning to compute the metric dimension of graphs
- Mixed metric dimension of some graphs
- Bounds on the sum of domination number and metric dimension of graphs
- The equidistant dimension of graphs
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
- On maximal det-independent (res-independent) sets in graphs
- Alternative parameterizations of \textsc{Metric Dimension}
- Low-dimensional representation of genomic sequences
- The vertex-edge resolvability of some wheel-related graphs
- Computation of edge resolvability of benzenoid tripod structure
- Computation of the double metric dimension in convex polytopes
- The connectivity and the spectral radius of commuting graphs on certain finite groups
- The multibases of symmetric caterpillars
- Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
- Metric dimension of generalized wheels
- On the metric dimension of the reduced power graph of a finite group
- On metric dimension of plane graphs with \(\frac{m}{2}\) number of 10 sided faces
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)
