完全k叉树的粘连度  

The tenacity and rupture degree of the complete k-ary tree

作　　者：陈忠[1] 李银奎[1] 

机构地区：[1]青海民族大学数学系,青海西宁810007

出　　处：《纯粹数学与应用数学》2013年第5期484-488,共5页Pure and Applied Mathematics

基　　金：教育部"春晖计划"(Z2010071)

摘　　要：相对于其他网络抗毁性的描述指标来说,图的粘连度是比较理想,也是比较合理的刻画参数.而完全k叉树作为重要的网络结构被广泛地应用在通信网和嵌入式系统芯片的优化设计方面.本文通过优化组合方法界定了完全k叉树的粘连度和毁裂度.从某种程度刻画了网络的抗毁性,为网络设计提供了一种客观的理论依据.完全k叉树的粘连度为1/k+1(kh+1-1),如h是奇数;1/k+1(kh+1+1),如h是偶数.完全k叉树的毁裂度为(2k-1)kh-1/2-1/k-1,如h是奇数;k h+2/2-1/k-1,如h是偶数.Abstract： Compared with other indicators for description of network anti-destroying ability, the tenacity degree of graph is ideal and also is a reasonable characterization parameter. As an important network structure, the complete k-ary trees is widely used in optimization design of communication network and embedded system chip. This article defines the tenacity and rupture degree of complete k-ary tree in the way of optimum combination. Describe the anti-destroying ability of network and by the way provide an objective theoretical basis for network designing. The tenacity of complete k-ary trees is1k＋1（kh＋1-1）,if h is an odd number; the tenacity of completek-ary trees is1k＋1（（kh＋1-1）,if h is an even number. The rupture degree of complete k-ary trees is（2k-1）kh-12,if h is an odd number; the rupture degree of complete k-ary trees iskh＋22-1k-1,if h is an even number.

关 键 词：粘连度 毁裂度 完全k叉树 

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