摘要
阶数为n且不同构的树的个数称为树列t_n.对n阶错排做了划分,汇总计算了对称群的循环指数,结合树的结构特性和波利亚计数定理,给出了一种确定t_n的算法并证明了算法的合理性.计算表明,树列t_n={1,1,1,2,3,6,11,23,47,106,235,551,…}.
In the meaning of isomorphism,the numbers of the tree with order n is called the sequence of trees,which is denoted by t_n.actorized on the n-derangement,the cycle index of symmetry group is obtained.By the constructional properties of the tree and the Polya counting formula,this paper provides a method to determine t_nnd finds that t_n {1,1,1,2,3,6,11,23,47,106,235,551,…}.
出处
《数学的实践与认识》
CSCD
北大核心
2014年第10期169-175,共7页
Mathematics in Practice and Theory
关键词
树列
置换群
波利亚计数
图论
树
sequence of trees
permutation group
Polya＇s counting
graph theory
tree
