Arbitrary Binary Tree To The Embedding Of The Combination Of Star Maps

In this paper. Embedding an arbitrary tree S at most T1 nodes into the corn-star graph with n dimension k order CS is obtained. Our embedding is one with dilation 0(1) and expansion no more than n We have defined the cyclic operation on the permutation and extended the definition of the factorial tree in [II. Our embedding is obtained based on these definitions. The embedding consists of two steps: first . we embed the factorial tree into the com-star graph by the operation on the permutations . then embed the arbitrary binary tree into the general factorial tree . Therefore, the cam-star graph may simulate an arbitrary binary tree with only a constant factor of communication delay. Where T1 is the number of...