Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900754 | Applied Mathematics and Computation | 2018 | 12 Pages |
Abstract
Let Cv(k; T) be the number of closed walks of length k starting at vertex v in a tree T. We prove that for any tree T with a given degree sequence Ï, the vector C(k; T)â¯â¡â¯(Cv(k; T), vâ¯ââ¯V(T)) is weakly majorized by the vector C(k;TÏ*)â¡(Cv(k;TÏ*),vâV(TÏ*)), where TÏ* is the greedy tree with the degree sequence Ï. In addition, for two trees degree sequences Ï and Ïâ², if Ï is majorized by Ïâ², then C(k;TÏ*) is weakly majorized by C(k;TÏâ²*).
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Ya-Hong Chen, Daniel Gray, Ya-Lei Jin, Xiao-Dong Zhang,