The following pages link to (Q3089290):
Displaying 17 items.
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- On the strong partition dimension of graphs (Q405298) (← links)
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes (Q440965) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Computing a metric basis of a bipartite distance-hereditary graph (Q2062127) (← links)
- The threshold dimension and threshold strong dimension of a graph: a survey (Q2073194) (← links)
- Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph (Q2188178) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- Computing a metric basis of a 2-connected bipartite distance-hereditary graph (Q2283041) (← links)
- Variable neighborhood search for the strong metric dimension problem (Q2840752) (← links)
- ON THE STRONG METRIC DIMENSION OF A TOTAL GRAPH OF NONZERO ANNIHILATING IDEALS (Q5076485) (← links)
- The strong metric dimension of some generalized Petersen graphs (Q6138258) (← links)
- The forcing metric dimension of a total graph of nonzero annihilating ideals (Q6147991) (← links)
- The Weisfeiler-Leman dimension of distance-hereditary graphs (Q6166669) (← links)
