Computation of the expected number of leaves in a tree having a given automorphism, and related topics

DOI10.1016/0166-218X(91)90078-BzbMath0763.05022WikidataQ127389416 ScholiaQ127389416MaRDI QIDQ1182309

Pierre Leroux, François Bergeron, Gilbert Labelle

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

automorphismspeciescycle index seriesnumber of leavesrandom rooted treeasymmetric rooted trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial identities, bijective combinatorics (05A19)

Related Items

The mathematical life of Pierre Leroux ⋮ The number of \(m\)-Husimi trees fixed by a permutation of the vertices ⋮ Lagrange inversion for species ⋮ Counting acyclic digraphs by sources and sinks ⋮ Counting asymmetric enriched trees ⋮ On the symmetry and asymmetry of combinatorial structures ⋮ On the construction of permutations of a given type kept fixed by conjugation

Uses Software

• Maple

Cites Work

• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Une théorie combinatoire des séries formelles
• Hereditarily finite sets and identity trees
• Théorie géométrique des polynômes eulériens
• On Combinatorial Structures Kept Fixed by the Action of a Given Permutation
• Enumeration of non-separable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item