Resolvability in graphs and the metric dimension of a graph
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Edge version of metric dimension and doubly resolving sets of the necklace graph
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- On metric dimension of some rotationally symmetric graphs
- Local metric dimension of graphs: generalized hierarchical products and some applications
- scientific article; zbMATH DE number 7666856 (Why is no real title available?)
- An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
- The 2-dimension of a tree
- Metric dimension parameterized by treewidth
- New resolvability parameters of graphs
- Maker-breaker resolving game
- On the strong metric dimension of annihilator graphs of commutative rings
- Fault-tolerant resolvability in some classes of line graphs
- Resolvability in subdivision of circulant networks \(C_n[1, k]\)
- Further new results on strong resolving partitions for graphs
- The threshold strong dimension of a graph
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks
- On the fault-tolerant metric dimension of convex polytopes
- On strong metric dimension of zero-divisor graphs of rings
- The connected metric dimension at a vertex of a graph
- Graphs with doubly resolving number 2
- On the metric dimension of barycentric subdivision of Cayley graphs \(\mathrm{Cay}(Z_{n}\oplus Z_{m})\)
- On the distance pattern distinguishing number of a graph
- The \(k\)-metric dimension
- Resolving dominating partitions in graphs
- On the metric representation of the vertices of a graph
- Metric and strong metric dimension in cozero-divisor graphs
- Mixed metric dimension of graphs with edge disjoint cycles
- The metric dimension of some generalized Petersen graphs
- The metric dimension for resolving several objects
- On metric dimensions of symmetric graphs obtained by rooted product
- The \(k\)-size edge metric dimension of graphs
- On the bounded partition dimension of some classes of convex polytopes
- scientific article; zbMATH DE number 7549712 (Why is no real title available?)
- Decision systems in rough set theory: a set operatorial perspective
- Error-correcting codes from \(k\)-resolving sets
- Metric dimension of fullerene graphs
- On the metric dimension, the upper dimension and the resolving number of graphs
- Symmetry properties of resolving sets and metric bases in hypercubes
- Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
- Different-distance sets in a graph
- Results on resolvability and metric dimension in graphs
- On two variations of identifying codes
- The full automorphism groups, determining sets and resolving sets of coprime graphs
- On unicyclic graphs of metric dimension 2
- On the partition dimension of a class of circulant graphs
- On the fault-tolerant metric dimension of certain interconnection networks
- On the edge metric dimension of convex polytopes and its related graphs
- On resolvability of a graph associated to a finite vector space
- The metric dimension of the enhanced power graph of a finite group
- The metric dimension of annihilator graphs of commutative rings
- Resolving sets and integer programs for recommender systems
- Edge metric dimensions via hierarchical product and integer linear programming
- The weighted 2-metric dimension of trees in the non-landmarks model
- On the limiting distribution of the metric dimension for random forests
- On the metric dimension of directed and undirected circulant graphs
- 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
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)
