The following pages link to On Metric Generators of Graphs (Q5704179):
Displaying 50 items.
- A linear time algorithm for metric dimension of cactus block graphs (Q278723) (← links)
- Computing the metric dimension of wheel related graphs (Q279611) (← links)
- Closed formulae for the local metric dimension of corona product graphs (Q283660) (← links)
- \(k\)-metric resolvability in graphs (Q283685) (← links)
- On the strong metric dimension of product graphs (Q283695) (← links)
- On the fractional strong metric dimension of graphs (Q313811) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- The simultaneous metric dimension of families composed by lexicographic product graphs (Q343771) (← links)
- Metric dimension of some distance-regular graphs (Q358647) (← 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 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)
- On the metric dimension of imprimitive distance-regular graphs (Q505687) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- Resolvability and strong resolvability in the direct product of graphs (Q511842) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- On the metric dimension of barycentric subdivision of Cayley graphs (Q519256) (← links)
- On randomly \(k\)-dimensional graphs (Q550450) (← links)
- Conditional resolvability of honeycomb and hexagonal networks (Q691636) (← links)
- On the local metric dimension of corona product graphs (Q726508) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- The metric dimension of Cayley digraphs (Q817748) (← links)
- The strong metric dimension of graphs and digraphs (Q868391) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- The simultaneous metric dimension of graph families (Q897612) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- The fractional strong metric dimension in three graph products (Q1627860) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- The strong metric dimension of the power graph of a finite group (Q1706126) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- The metric dimension of some generalized Petersen graphs (Q1727099) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- Computing metric dimension of compressed zero divisor graphs associated to rings (Q1737405) (← links)
- Sharp bounds for partition dimension of generalized Möbius ladders (Q1738248) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- The weighted 2-metric dimension of trees in the non-landmarks model (Q1751125) (← links)
- On the metric dimension of infinite graphs (Q1759836) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- On the strong metric dimension of corona product graphs and join graphs (Q1949107) (← links)
- Resolvability in subdivision of circulant networks \(C_n[1, k]\) (Q2004177) (← links)
- The fractional metric dimension of permutation graphs (Q2018874) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
