Largest domination number and smallest independence number of forests with given degree sequence

For a sequence dd of non-negative integers, let F(d)F(d) be the set of all forests whose degree sequence is dd. We present closed formulas for γmaxF(d)=max{γ(F):F∈F(d)} and αminF(d)=min{α(F):F∈F(d)} where γ(F)γ(F) and α(F)α(F) are the domination number and the independence number of a forest FF, respectively.