完全图的生成树中的完全m叉树

Complete m binary trees of complete graphs′ spanning trees

在完全m叉树中,假设其叶数为t,分支点数为i,则(m-1)i=t-1.证明了完全图的生成树中的完全m叉树的个数和构造是有规律的,而且当完全图的顶点数n固定时,其生成树中的完全m叉树的个数就被固定,构造也有规律可循,且当n为偶数时,生成树中不含有完全偶数叉树.

In complete m binary trees,the number of leaves is t,the number of branch points is i.Then（m-1）i=t-1,it is proven that the number and structure of the complete m binary trees of the complete graphs＇ spanning trees are regular,and the structure regular is in relation to the vertices of the complete graphs when the number of the vertices of the complete graphs is fixed,the number of the complete m binary trees of the spanning trees is fixed,and the structure is regular,when n is even,there＇s no complete even binary tree.