Proves multiset resolving sets equal ID-colorings, establishes NP-completeness of computing multiset dimension, bounds it by 4 on king grids, and characterizes when it is finite on certain strong products.
The multiset dimension of graphs, arXiv:1711.00225 [math.CO] (1 Nov 2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity and equivalency of multiset dimension and ID-colorings
Proves multiset resolving sets equal ID-colorings, establishes NP-completeness of computing multiset dimension, bounds it by 4 on king grids, and characterizes when it is finite on certain strong products.