摘要
分析了正则m叉树T中m,分枝点个数i和叶数t与子正则m叉树中分枝点个数和叶数之间的关系,利用对正则m叉树T的完全分支进行讨论方法,导出了正则m叉树T的恰有k个分支N(Tt,k)的递归计数公式,在m=2的特殊情况,得到正则2叉树计数递归关系式,并给出应用.
For a regular m-furcating tree, by means of discussing a method of complete components, a recurrence relation of k-component N(T_t,k) is derived through analysing the relations among i′, t′and m of sub-furcating trees with i,t and m of a regular m-Furcating tree, and an application of N(T_t,k) of a regular binary-furcating tree is presenfed.
出处
《大连铁道学院学报》
2004年第3期1-5,共5页
Journal of Dalian Railway Institute
关键词
正则
计数公式
分支
分枝点
递归关系
个数
叶数
Regualr m-furcating tree
Component
Complete Graph
Branch′s vertice
the Number of Leaves
