Rezultaty - M. E. Messinger
-
1
Eulerian $k$-dominating reconfiguration graphs
Wydane 2025-01-01Dokumenty pełnotekstoweFor a graph $G$, the vertices of the $k$-dominating graph, denoted $\mathcal{D}_k(G)$, correspond to the dominating sets of $G$ with cardinality at most $k$. Two vertices of $\mathcal{D}_k(G)$ are adjacent if and only if the corresponding dominating sets in $G$ can be obtained from one other by addi...
Artykuł