| Article ID: | iaor19921449 |
| Country: | Netherlands |
| Volume: | 34 |
| Start Page Number: | 49 |
| End Page Number: | 66 |
| Publication Date: | Nov 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Bergeron F., Labelle G., Leroux P. |
The authors derive explicit formulas for the expected number of leaves in a random rooted tree that is fixed by a given permutation of the nodes, and similarly for (unrooted) trees and endofunctions. The main tool is the cycle index series of a species. The cases of asymmetric rooted tree and