期刊文献+

SOME EQUAL DIVISIONS ON ORDERED TREE SET

SOME EQUAL DIVISIONS ON ORDERED TREE SET
下载PDF
导出
摘要 We say a divisien (S = SA or SB, g) is equal if it divides set S into two subsets SA and SB satisfying f (SA) = f (SB), where f is som attribute function on these sets and SA or SB need not be empty. In the present paper, we have obtained some equal divisions on set of ordered tree with n modes: two equal divisions on tree set; two equal divisions on node set; two divisions on leaf set, one is equal, another one is ''asymptotically'' equal. We conclude that, ordered tree set is on its good behavior in equal dividing. We say a divisien (S = SA or SB, g) is equal if it divides set S into two subsets SA and SB satisfying f (SA) = f (SB), where f is som attribute function on these sets and SA or SB need not be empty. In the present paper, we have obtained some equal divisions on set of ordered tree with n modes: two equal divisions on tree set; two equal divisions on node set; two divisions on leaf set, one is equal, another one is ''asymptotically'' equal. We conclude that, ordered tree set is on its good behavior in equal dividing.
作者 王振宇
出处 《Acta Mathematica Scientia》 SCIE CSCD 1992年第4期392-399,共8页 数学物理学报(B辑英文版)
基金 Supported by China National Natural Science Foundation.
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部