线性超树的孤立点与悬挂边数目  

Isolated Vertice and Hang Edge Number of the Linear Hypertree

作　　者：龚劬[1] 何静[1] 

机构地区：[1]重庆大学数理学院,重庆400030

出　　处：《重庆大学学报（自然科学版）》2006年第6期75-77,86,共4页Journal of Chongqing University

摘　　要：在先通过引入线性超树的对应二部树的特殊对应性质来刻划超树的顶点与超边的结构,得出了线性超树的孤立点数目的计算公式和一系列推论,从而进一步揭示了度序列与线性超树的关系.然后给出了求线性超树悬挂边数目的可行算法,其算法复杂度仅为O(|E(T)|2).这对于充实超树的计数理论与应用实践均是有益的.This paper puts forward another path in proving process. By using bipartite tree special property to depict the vertices and edges of linear hypertree , the authors obtain the counting formula and a series inferences of the linear hypertree isolated vertices , thus further the relation of degree sequence and linear hypertree are given. Then they give out the algorithm of hang-edges ,and the calculated complexity of algorithm is O（｜E（T）｜^2）. This is beneficial for the hypertree counting theories and the practice.

关 键 词：线性超树 孤立点 悬挂边 二部树 

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