Showing math.COShow all
3 papers · 1 filter
math.CO2018
On majorization of closed walks vector of trees with given degree sequences
Ya-Hong Chen, Daniel Gray, Ya-Lei Jin +1
Let be the number of the closed walks of length starting at vertex in a tree . We prove that for a given tree degree sequence , then for any tree with de…
math.CO2012
Trees with the most subtrees -- an algorithmic approach
Xiu-Mei Zhang, Xiao-Dong Zhang, Daniel Gray +1
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesti…
math.CO2012
The Number of Subtrees of Trees with Given Degree Sequence
Xiu-Mei Zhang, Xiao-Dong Zhang, Daniel Gray +1
This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence…