完全k叉树的离散数和完整度  

The scattering number and integrity of the complete k-ary tree

作　　者：李银奎[1] 段宝荣 陈忠[1] 

机构地区：[1]青海民族大学数学系,青海西宁810007 [2]青海省互助县教委,青海互助810500

出　　处：《纯粹数学与应用数学》2011年第3期I0002-I0002,285-291,共8页Pure and Applied Mathematics

基　　金：国家自然基金(10861009)

摘　　要：图的离散数和完整度是比较理想的刻画网络抗毁性的度量参数,而完全k叉树作为重要的网络结构被广泛地应用在通信网和嵌入式系统芯片的优化设计方面.通过界定了完全k叉树的离散数和完整度,从某种程度刻画了网络的抗毁性,为网络设计提供理论依据,同时修正了相关文献的错误.Computer or communication networks must be constructed to be as stable as possible, not only with the respect to the initial disruption, but also with respect to the possible reconstruction of network. Many graph theoretical parameters have been used to describe the stability of communication networks. The scattering number and integrity of graph are reasonable parameters. The complete k-ary trees are widely used to design communication networks. By determine the scattering number and integrity of complete k-ary trees. The mistakes of relative paper is corrected.

关 键 词：离散数 完整度 完全k叉树 反例 

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