Does any connected graph G have a spanning tree T with the same domination number? Let $G$ be a simple graph. A spanning tree of a connected graph $G$ is an acyclic connected subgraph $T$ of $G$ such that $V_T = V_G$.
A dominating set of $G$ is a subset $W$ of $V_G$ such that every vertex in $V_G\setminus W$ is adjacent to some vertex in $W$. The domination number of $G$, $\gamma(G)$, is the minimum on the cardinalities of the dominating sets of $G$.
Evidently, for any spanning subgraph $H$ of $G$, the domination number of $H$ is lower-bounded by the domination number of $G$, i.e. $\gamma(G) \le \gamma(H)$. Particularly, for every spanning tree $T$ of a connected graph $G$, $\gamma(T) \ge \gamma(G)$.
Does every connected graph $G$ have a spanning tree $T$ such that $\gamma(G)=\gamma(T)$?

Assume $G$ is a graph and $X$ is a set such that every vertex is in $X$ or adjacent to a vertex in $X$.
We prove there is a spanning tree $T$ of $G$ such that every vertex is in $X$ or adjacent to a vertex in $X$. For each vertex $v$ not in $X$ we add exactly one edge from $v$ to $X$ that is in $G$. After doing this the graph has no cycles, because it is bipartite, and all the vertices in $G\setminus X$ have degree $1$. We can make this graph into a tree by adding edges in $G$.
