Complexity and Equivalency of Multiset Dimension and ID-colorings



: Hakanen, Anni; Yero, Ismael G.

Publisher: IOS PRESS

: AMSTERDAM

: 2024

: Fundamenta Informaticae

: FUND INFORM

: 191

: 3-4

: 315

: 330

: 16

: 0169-2968

: 1875-8681

DOI: https://doi.org/10.3233/FI-242185

: https://content.iospress.com/articles/fundamenta-informaticae/fi242185

: https://arxiv.org/pdf/2303.06986


This investigation is firstly focused into showing that two metric parameters represent the same object in graph theory. That is, we prove that the multiset resolving sets and the ID-colorings of graphs are the same thing. We also consider some computational and combinatorial problems of the multiset dimension, or equivalently, the ID-number of graphs. We prove that the decision problem concerning finding the multiset dimension of graphs is NP-complete. We consider the multiset dimension of king grids and prove that it is bounded above by 4. We also give a characterization of the strong product graphs with one factor being a complete graph, and whose multiset dimension is not infinite.



Last updated on 2025-27-01 at 20:00