A Recurrence Formula for the S(n)-Factoring Number of a Regular m -furcating tree
Received:January 12, 2000  
Key Words: regular m-furcating tree   component   factor   complete graph   brach's vertice   the number of leaves  
Fund Project:
Author NameAffiliation
YANG Li-min Dept. of Appl. Math.
Dalian University of Technology
Liaoning
China 
YAO Hong PLA. Information Engeneering University
Zhengzhou
China 
Hits: 2146
Download times: 850
Abstract:
      For a regular m-furcating tree, the authors derive a recurrence formula of the number of its S(n)={Ki:1≤i≤n}-factor through analysing the relation among i,t and m of sub-furcating trees. Specially, m=2, the recurrence formula of a regular binary tree is as follows: At=At/22+2At/42 At/2, with initial conditions: A2=3, A4=15.
Citation:
DOI:10.3770/j.issn:1000-341X.2003.02.031
View Full Text  View/Add Comment