Rooted tree

The series (2) of Sec. 3, too, is a generating function the collection of figures comprises the planted trees which are topologically different. The nodes of the rooted trees play the role of the balls in the figure there is only one category of balls, and thus the series depends only on one variable. Figure 1 indicates how the figures (planted trees) of the same content (number of nodes) are combined in the coefficients. 

Not "rooted tree" (cf. Konig, 1, p. " 6). I emphasize that not an arbitrary vertex but an endpoint is selected as root. 

A paper in the same journal [PolG36b] elaborated on isomer enumeration and the corresponding asymptotic results. Here the functional equations for the generating functions for four kinds of rooted trees were presented without proof. They were, in a slightly different notation, formulae (8), (4), and (7) in the introduction to Polya s main paper, and one form of the functional equation for the generating function for rooted trees. From these results a number of asymptotic formulae were derived. These results were all incorporated into the main paper. 

The use of Polya s Theorem in the enumeration of rooted trees is amply described in Polya s paper and needs little comment here. We shall note an important point in connection with the enumeration of alkyl radicals. A radical is a portion of a molecule that is regarded as a unit that is, it will be treated much the same as if it were a... 

To find the number of trees rooted at an edge we have merely to take the distinguished edge and add a rooted tree at each end. This is a Polya-type problem with two interchangeable boxes, and figure generating function T(x). Polya s Theorem thus gives... 

If we progressively delete vertices of degree 1 from a connected graph C, until no more such vertices remain, we shall obtain a connected graph F which we can call the "frame" of C. The graph C is then seen to consist of the graph F at each vertex of which a rooted tree has been attached, so that the root of the tree is identified with the vertex of F. Figure 8 shows a typical example. 

For our present purpose we shall need to retain much more information about these graphs. Specifically, we want to find the sum of the cycle indexes of their automorphism groups. This is still basically a Polya-type problem, for which we replace T(x) by the sum of the cycle indexes of rooted trees. If T denotes the set of rooted trees, then this cycle index sum can be written Z(T ). Note that we can always recover F(x) from Z( T) for since the sum of the coefficients in the cycle index is 1, we have only to replace each occurrence of 5j by x Each cycle index for a tree on n vertices then reduces to x". This result is general and applies to any cycle index sum. 

Carbon analyses for CAR05-T02 may contain interference from high sulfide content of sample. b B-horizon soil sample collected beneath an up-rooted tree over mineralized bedrock. 

The reacting system can be represented by graphs (trees) In which the nodes represent monomer units. In the theory of branching processes this collection of graphs (Figure 2) - a molecular forest -Is transformed Into another forest - the forest of rooted trees. 

Figure 2. Transformation of a molecular forest into a forest of rooted trees and generation of this forest.

Tennessee, 1974, from soil accidentally contaminated in 1944 Roots Trees... 

Rooted Tree Treatment Regular Star Molecules88)... 

Fig. 5. Two typical rooted tree representations of a four ray star-molecule. Tb the branch point selected as root Ttj the j-th element of a ray selected as root...

Fig. 6 a, b. A tetrafunctionally branched molecule (a) placed on a lattice and (b) the corresponding rooted tree representation. Note The units in the first, second, third etc. shell of neighbours come to lie well defined in generation gt, g2, g3 etc... 

Second, on placing a molecule on a special lattice, a picture is unconsciously engraved in the mind suggesting that the molecule may behave in three-dimensional space as seen in the graph or given by the computer. A special lattice always implies certain constraints which actually need not exist in this form. The rooted tree representation is free from this problem of how a molecule is embedded in space it only displays the connectivity, and this in a very clear form95 97). 

The number fractions nj and some representative rooted trees have been selected arbitrarily to illustrate the calculations)... 

Fig. 8. The rooted tree lattice for a tetrafunctionally branched polymer, and the average population of units in the n-th generation when a was the extent of reaction of the functional groups...

Fig. 11. A special rooted tree as illustration for the connection between the total distribution of units in the second generation Nj (2) and those arising from the various functional groups 1,2,3 and 4 denoted as Njj (2), N2j (2) etc...

This complicated triple sum can be simplified by applying the rooted tree treatment. Here the outline is confined to a binary copolymer the results may easily be generalized to copolymers with r components. 

---