تقرير
Complexity and equivalency of multiset dimension and ID-colorings
| العنوان: | Complexity and equivalency of multiset dimension and ID-colorings |
|---|---|
| المؤلفون: | Hakanen, Anni, Yero, Ismael G. |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Discrete Mathematics, Mathematics - Combinatorics, 05C12, 05C76 |
| الوصف: | 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. |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.3233/FI-242185 |
| URL الوصول: | http://arxiv.org/abs/2303.06986 |
| رقم الأكسشن: | edsarx.2303.06986 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.3233/FI-242185 |
|---|