加载中…
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 degree sequence , the sequence is weakly majorized by the sequence , where is the greedy tree corresponding to . In addition, for two trees degree sequences , if is majorized by , then is weakly majorized by .

生成讲解博客的中文版本

生成AI智能校验的中文版本