The set of all values of the domination number in trees with a given degree sequence

We find the set of all values of the domination number for a class of trees with some given vertex degrees that forms a segment of naturals. We prove that each intermediate value of the segment can be obtained by gradually changing the tree that minimizes the domination number and with the use of two special operations, so that the last tree maximizes the domination number. Illustr. 1, bibliogr. 12.