The following pages link to (Q4075485):
Displaying 14 items.
- The \(k\)-metric dimension of the lexicographic product of graphs (Q279212) (← links)
- On the strong metric dimension of product graphs (Q283695) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- A note on the partition dimension of Cartesian product graphs (Q613309) (← links)
- On the metric dimension of corona product graphs (Q639103) (← links)
- Extending the metric dimension to graphs with missing edges (Q897908) (← links)
- Resolvability in graphs and the metric dimension of a graph (Q1582071) (← links)
- Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Computing the \(k\)-metric dimension of graphs (Q1735142) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- On the partition dimension of trees (Q2636811) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
