The following pages link to Resolvability of Hamming Graphs (Q5128504):
Displaying 11 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- The retracts of Hamming graphs (Q1193717) (← links)
- Retracts of infinite Hamming graphs (Q1386474) (← links)
- On existence of perfect bitrades in Hamming graphs (Q2005721) (← links)
- On vertices contained in all or in no metric basis (Q2161262) (← links)
- Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
- Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces (Q4652644) (← links)
- On metric dimensions of hypercubes (Q5871598) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric (Q6116190) (← links)
- The edge fault-tolerance about the strong Menger edge-connectivity of order \(r\) among Hamming graph (Q6611032) (← links)
