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 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
- 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
- Mixed metric dimension of graphs with edge disjoint cycles
- Title not available (Why is that?)
- 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
- The \(k\)-metric dimension
- On unicyclic graphs of metric dimension 2
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- New resolvability parameters of graphs
- Metric dimension parameterized by treewidth
- Maker-breaker resolving game
- On the strong metric dimension of annihilator graphs of commutative rings
- On the limiting distribution of the metric dimension for random forests
- Title not available (Why is that?)
- Metric dimension of fullerene graphs
- Resolving sets and integer programs for recommender systems
- Edge metric dimensions via hierarchical product and integer linear programming
- The connected metric dimension at a vertex of a graph
- On resolvability of a graph associated to a finite vector space
- An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
- Further new results on strong resolving partitions for graphs
- On the bounded partition dimension of some classes of convex polytopes
- Symmetry properties of resolving sets and metric bases in hypercubes
- On the metric dimension of directed and undirected circulant graphs
- Local metric dimension of graphs: generalized hierarchical products and some applications
- The metric dimension of annihilator graphs of commutative rings
- The 2-dimension of a tree
- On metric dimension of some rotationally symmetric graphs
- Title not available (Why is that?)
- On the partition dimension of a class of circulant graphs
- Results on resolvability and metric dimension in graphs
- Error-correcting codes from \(k\)-resolving sets
- 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
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)
