On the minimal doubly resolving sets of Harary graph
From MaRDI portal
Publication:5142452
Recommendations
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- Minimal doubly resolving sets of antiprism and Möbius ladders
- Minimal doubly resolving sets of necklace graph
- Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
- Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
Cited in
(7)- Computation of the double metric dimension in convex polytopes
- Minimal doubly resolving sets of prism graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- On doubly resolving sets in graphs
- Minimal doubly resolving sets of antiprism and Möbius ladders
- Minimal doubly resolving sets of necklace graph
This page was built for publication: On the minimal doubly resolving sets of Harary graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142452)