A characterization of trees having a minimum vertex cover which is also a minimum total dominating set

César Hernández-Cruz, Magdalena Lemańska, Rita Zuazua

A vertex cover of a graph $G=(V,E)$ is a set $X\subseteq V$ such that each edge of $G$ is incident to at least one vertex of $X$. A dominating set $D\subseteq V$ is a total do…