Pages that link to "Item:Q1582071"
From MaRDI portal
The following pages link to Resolvability in graphs and the metric dimension of a graph (Q1582071):
Displayed 50 items.
- On the metric dimension of two families of convex polytopes (Q258375) (← links)
- A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
- Computing the metric dimension of wheel related graphs (Q279611) (← links)
- \(k\)-metric resolvability in graphs (Q283685) (← links)
- Simultaneous resolvability in graph families (Q283715) (← links)
- On the metric dimension of circulant and Harary graphs (Q298410) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Resolving-power dominating sets (Q299722) (← links)
- On the fractional strong metric dimension of graphs (Q313811) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Metric dimension of some distance-regular graphs (Q358647) (← links)
- The metric dimension of metric spaces (Q380725) (← links)
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the strong partition dimension of graphs (Q405298) (← links)
- The fractional metric dimension of graphs (Q411666) (← links)
- On the metric dimension of circulant graphs (Q427599) (← links)
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes (Q440965) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\) (Q477810) (← links)
- Vertex and edge dimension of hypergraphs (Q489357) (← links)
- On metric dimension of permutation graphs (Q489731) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- Computing the metric dimension of a graph from primary subgraphs (Q503686) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- Vertices, edges, distances and metric dimension in graphs (Q510989) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- On the metric dimension of barycentric subdivision of Cayley graphs (Q519256) (← links)
- On randomly \(k\)-dimensional graphs (Q550450) (← links)
- A note on the partition dimension of Cartesian product graphs (Q613309) (← links)
- On families of convex polytopes with constant metric dimension (Q623216) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- Metric dimension and \(R\)-sets of connected graphs (Q659718) (← links)
- Conditional resolvability of honeycomb and hexagonal networks (Q691636) (← links)
- The \(k\)-metric dimension of corona product graphs (Q726506) (← links)
- On the local metric dimension of corona product graphs (Q726508) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- The twin non-commuting graph of a group (Q777201) (← links)
- Metric dimension and pattern avoidance in graphs (Q777351) (← links)
- The metric dimension of Cayley digraphs (Q817748) (← links)
- Bounds on the domination number and the metric dimension of co-normal product of graphs (Q824651) (← links)
- On the metric dimension of generalized tensor product of interval with paths and cycles (Q827175) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- The strong metric dimension of graphs and digraphs (Q868391) (← links)
- On the number of resolving pairs in graphs (Q897274) (← links)
- The simultaneous metric dimension of graph families (Q897612) (← links)
- Extending the metric dimension to graphs with missing edges (Q897908) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- Determining sets, resolving sets, and the exchange property (Q968219) (← links)