Pages that link to "Item:Q2391996"
From MaRDI portal
The following pages link to On strong metric dimension of graphs and their complements (Q2391996):
Displayed 10 items.
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- On the commuting graph of semidihedral group (Q2049019) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← 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)
- Fault-tolerant strong metric dimension of graphs (Q6059083) (← links)
- The strong metric dimension of some generalized Petersen graphs (Q6138258) (← links)