The number of \(m\)-Husimi trees fixed by a permutation of the vertices

DOI10.1016/0012-365X(94)00127-5zbMath0824.05031OpenAlexW2082434353MaRDI QIDQ1893980

Ivan Constantineau

Publication date: 5 September 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00127-5

zbMATH Keywords

cyclesspecies of structuresenumeration formulaHusimi treeinvariant under a given permutation

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-similarity in the combinatorial theory of orthogonal polynomials
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Une théorie combinatoire des séries formelles
• Computation of the expected number of leaves in a tree having a given automorphism, and related topics
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• On Combinatorial Structures Kept Fixed by the Action of a Given Permutation
• On the Number of Husimi Trees

This page was built for publication: The number of \(m\)-Husimi trees fixed by a permutation of the vertices