两类bc树的bc子树的计数  

Enumeration of subbc-trees of two kinds of bc-trees

作　　者：杨雨[1] 王德强[2] 张少芳[1] 孟垂茁[1] 

机构地区：[1]大连海事大学数学系,辽宁大连116026 [2]大连海事大学航海学院,辽宁大连116026

出　　处：《大连海事大学学报》2007年第S1期62-65,70,共5页Journal of Dalian Maritime University

摘　　要：用生成函数的方法研究了bc树的bc子树的计数问题.得出n顶点星形(路径)bc树的bc子树比任一个n顶点bc树所含的bc子树都多(少),以及路径bc树和星形bc树所含的bc子树数的精确值;对于路径bc树,分析了经过任给顶点的bc子树的计数问题,也给出相应的bc子树数的精确值;对于一般bc树给出了其所含bc子树个数的一个上界.The paper studied the enumeration of subbc-trees of bc-trees by using the generating function, and obtained that star bc-tree(path bc-tree) on n vertices has the most(least) subbc-trees among bc-trees on n vertices and also gave out the exact number of subbc-trees of path bc-tree and star bc-trees;for path bc-trees,the paper analysed the enumeration of subbc-tees passing through any given vertex and gave out the exact number of subbc-trees containing the corresponding vertex;and gave give out a upper bound for general bc-trees as well.

关 键 词：路径bc树 星形bc树 生成函数 计数 bc树的分裂 

分 类 号：O157.5[理学—数学]