The weak k-metric dimension of K_n□K_n is determined exactly for all n≥3 and 2≤k≤2n, complementing the known k=1 case.
Foster-Greenwood, Ch
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On the weak $k$-metric dimension of Hamming graphs
The weak k-metric dimension of K_n□K_n is determined exactly for all n≥3 and 2≤k≤2n, complementing the known k=1 case.