Name
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π′*). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.amc.2018.05.007 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Majorization,Closed walk,Trees,Degree sequence | Combinatorics,Vertex (geometry),Mathematical analysis,Majorization,Degree (graph theory),Mathematics | Journal |
Volume | ISSN | Citations |
336 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ya-Hong Chen | 1 | 2 | 1.75 |
| Daniel Gray | 2 | 16 | 2.14 |
| Ya-Lei Jin | 3 | 0 | 0.34 |
| Xiao-Dong Zhang | 4 | 19 | 7.31 |