The following pages link to (Q4660333):
Displaying 11 items.
- Conditional resolvability of honeycomb and hexagonal networks (Q691636) (← links)
- Guessing bank PINs by winning a mastermind game (Q692940) (← links)
- The number of pessimistic guesses in Generalized Mastermind (Q987843) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs (Q2958353) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension (Q6105989) (← links)
- The local metric dimension of amalgamation of graphs (Q6571571) (← links)
