Pages that link to "Item:Q400431"
From MaRDI portal
The following pages link to On the strong metric dimension of Cartesian and direct products of graphs (Q400431):
Displayed 15 items.
- The \(k\)-metric dimension of the lexicographic product of graphs (Q279212) (← links)
- On the fractional strong metric dimension of graphs (Q313811) (← links)
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← 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)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- The fractional strong metric dimension in three graph products (Q1627860) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- The general position problem and strong resolving graphs (Q2278440) (← links)
- A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\) (Q2312664) (← links)
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs (Q5216449) (← links)
- Strong metric dimension of rooted product graphs (Q5739613) (← links)
- Strong resolving partitions for strong product graphs and Cartesian product graphs (Q5962517) (← links)