Acta mathematica scientia,Series B ›› 1990, Vol. 10 ›› Issue (4): 396-401.

• Articles • Previous Articles     Next Articles

MORE ON ADDITIVE ENUMERATION PROBLEMS OVER TREES

Wang Zhenyu, Sun Chaoyi   

  1. Wuhan Digital Engineering Institute, Wuhan, China
  • Received:1989-12-17 Online:1990-12-25 Published:1990-12-25
  • Supported by:
    Supported by National Natural Science Foundation of China.

Abstract: The present paper discusses more about additive enumeration problems over some tree families, especially, the trees with nodes and leaves of given numbers. It establishes a uniform solving scheme for additive enumeration problems over V(ery) simply generated tree families. Based on the uniform scheme, a series of additive enumeration problems over tree families, including leaf path length counting and node path length counting, are solved. The tree families related include:binary tree, t-ary tree and ordered tree.

Trendmd