度序列与树中的叶子数

Degree sequence and number of leaves

  • 摘要: 给出了树的度序列与叶子总数之间的关系式,从而得到一种精确地计算树的叶子数的方法,并证明了结论:度序列满足该关系式的简单连通图必是树.对树形图中的度序列和叶子数也有类似的结果.

     

    Abstract: A relation between a tree’s degree sequence and its number of leaves is afforded.It is further shown that a simple connected graph whose degree sequence satisfies the relation must be a tree.There are similar results in arborescences.

     

/

返回文章
返回