Abstract
Metric properties of Hanoi graphs H-p(n) are not as well understood as those of the closely related, but structurally simpler Sierpinski graphs S-p(n). The most outstanding open problem is to find the domination number of Hanoi graphs. Here we concentrate on the first non-trivial case of H-4(3), which contains no 1-perfect code. The metric dimension and the dominator chromatic number of H-4(3) will be determined as well. This leads to various conjectures for the general case and will thus provide an orientation for future research.
Item Type: | Journal article |
---|---|
Faculties: | Mathematics, Computer Science and Statistics > Mathematics |
Subjects: | 500 Science > 510 Mathematics |
ISSN: | 1234-3099 |
Language: | English |
Item ID: | 88977 |
Date Deposited: | 25. Jan 2022, 09:28 |
Last Modified: | 13. Aug 2024, 12:44 |