For a sequence d of non-negative integers, let F(d) be the set of all forests whose degree sequence is d. We present closed formulas for γmaxF(d)=max{γ(F):F∈F(d)} and αminF(d)=min{α(F):F∈F(d)} where γ(F) and α(F) are the domination number and the independence number of a forest F, respectively.
@article{arxiv.1507.04650,
title = {Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence},
author = {Michael Gentner and Michael A. Henning and Dieter Rautenbach},
journal= {arXiv preprint arXiv:1507.04650},
year = {2015}
}