Answers are grounded in this paper and cite their sources.
In 2020, Hinz and Movarraei conjectured that the domination numbers of Hanoi graphs and Sierpiński graphs coincide, that is, γ ( H p n ) = γ ( S p n ) . Using an integer programming formulation, we disprove this conjecture by providing several counterexamples.
No takes yet. Share an insight, caveat, or question.
El-Mehdi Mehiri (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: