On metric dimension of flower graphs f_n m and convex polytopes
From MaRDI portal
Publication:2870975
Recommendations
Cited in
(14)- Resolvability in subdivision of circulant networks \(C_n[1, k]\)
- Power graphs and exchange property for resolving sets
- On some plane graphs and their metric dimension
- Fault-tolerant metric dimension of generalized wheels and convex polytopes
- Computing the metric dimension of convex polytopes generated by wheel related graphs
- Computing the metric dimension of wheel related graphs
- The metric dimension of sunflower, t-fold wheel, and K₁+(P_n P_m)
- scientific article; zbMATH DE number 7688341 (Why is no real title available?)
- Computing metric dimension of two types of claw-free cubic graphs with applications
- On symmetrical convex polytopes and their edge resolvability
- Sharp bounds of partition resolvability of convex polytopes
- Fault tolerant metric resolvability of convex polytopes
- On sharp bounds of fault-tolerant partition dimension of convex polytopes
- On metric dimension of \(h_{s\times p}\) hellebores flower graph
This page was built for publication: On metric dimension of flower graphs \(f_{n \times m}\) and convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870975)