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π′*).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
