Complexity and equivalency of multiset dimension and ID-colorings
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911572403683328 |
|---|---|
| author | Hakanen, Anni Yero, Ismael G. |
| author_facet | Hakanen, Anni Yero, Ismael G. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_06986 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Complexity and equivalency of multiset dimension and ID-colorings Hakanen, Anni Yero, Ismael G. Discrete 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. |
| title | Complexity and equivalency of multiset dimension and ID-colorings |
| topic | Discrete Mathematics Combinatorics 05C12, 05C76 |
| url | https://arxiv.org/abs/2303.06986 |