Article ID Journal Published Year Pages File Type
418516 Discrete Applied Mathematics 2016 7 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Largest domination number and smallest independence number of forests with given degree sequence
Authors
, , ,