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)
- Minimum weight resolving sets of grid graphs
- The doubly metric dimension of cylinder graphs and torus graphs
- The equidistant dimension of graphs
- On the connected metric dimension of graphs and their complements
- On metric dimension of P(n, 2)ʘK1 graph
- The threshold dimension and irreducible graphs
- The connectivity and the spectral radius of commuting graphs on certain finite groups
- A note on \(k\)-metric dimensional graphs
- Unicyclic graphs with non-isolated resolving number $2$
- The solid-metric dimension
- On maximal det-independent (res-independent) sets in graphs
- The vertex-edge resolvability of some wheel-related graphs
- On unicyclic graphs of metric dimension 2 with vertices of degree 4
- Bounds on the sum of domination number and metric dimension of graphs
- Fault-tolerant edge metric dimension of certain families of graphs
- On the metric basis in wheels with consecutive missing spokes
- Metric dimension and edge metric dimension of windmill graphs
- Metric dimension of generalized wheels
- Mixed metric dimension of some plane graphs
- The dominant edge metric dimension of graphs
- Metric dimension of heptagonal circular ladder
- 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
- The locating number of hexagonal Möbius ladder network
- TOTAL RESOLVING NUMBER OF CORONA OF GRAPHS AND COMPLETE GRAPHS
- 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
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
- The local complement metric dimension of graphs
- Alternative parameterizations of \textsc{Metric Dimension}
- Resolvability and fault-tolerant resolvability structures of convex polytopes
- Edge metric dimension and mixed metric dimension of planar graph \(Q_n\)
- Truncated metric dimension for finite graphs
- Vertex and edge metric dimensions of cacti
- Resolving sets tolerant to failures in three-dimensional grids
- Computation of edge resolvability of benzenoid tripod structure
- Computation of the double metric dimension in convex polytopes
- Some binary products and integer linear programming for \(k\)-metric dimension of graphs
- Low-dimensional representation of genomic sequences
- Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
- Metric dimension: from graphs to oriented graphs
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- Link dimension and exact construction of graphs from distance vectors
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
- On doubly resolving sets in graphs
- Mixed metric dimension of some graphs
- The threshold dimension and threshold strong dimension of a graph: a survey
- \(l\)-clique metric dimension of graphs
- 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
- The simultaneous local metric dimension of graph families
- The multibases of symmetric caterpillars
- Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
- The multiresolving sets of graphs with prescribed multisimilar equivalence classes
- The local metric dimension of strong product graphs
- Nonlocal metric 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)