| Autor: |
Kira Adaricheva, Heather Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth |
| Rok vydání: |
2021 |
| Předmět: |
|
| DOI: |
10.48550/arxiv.2112.04448 |
| Popis: |
The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove that the dominating graph of any tree has a Hamilton path. We also show how a result about binary strings leads to a proof that the dominating graph of a cycle on $n$ vertices has a Hamilton path if and only if $n\not\equiv 0 \pmod 4$. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
