Abstract
We derive new functional equations at a species level for 2-trees including a new dissymmetry theorem. From these equations we deduce various enumerative series expansions for certain classes of 2-trees, including the molecular decomposition in some cases.
Résumé
Nous obtenons de nouvelles équations fonctionnelles pour les 2-arbres, incluant un nouveau théorème de dissymétrie. Nous en déduisons des séries génératrices pour quelques classes de 2-arbres et même la décomposition moléculaire dans certains cas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Bergeron, G. Labelle, and P. Leroux, Combinatorial Species and tree-like structures, Encyclopedia of Mathematics and its Applications, Vol. 67, Cambridge University Press, (1998).
L.W. Beineke and J.W. Moon, Several proofs of the number of labeled2-dimensional trees. In "Proof Techniques in Graph Theory" ( F. Harary, editor), Academic Press, New York (1969), pp. 11 - 20.
L. Beineke and R. Pippert, The number of labeled k-dimensional trees, Journal of Combinatorial Theory 6 (1969), pp. 200 - 205
Michel Bousquet, Espèces de structures et applications au dénombrement de cartes et de cactus planaires,Thèse de doctorat, UQAM (1998). Publications du LaCIM, Vol. 24 (1999).
D. Foata, Enumerating k-trees, Discrete Math. 7 (1974) pp. 317 - 322.
T. Fowler, I. Gessel, G. Labelle, P. Leroux, The Specification of 2-trees, In preparation, (2000).
B. Leclerc, Une classe de graphes: les k-arbres, preprint, (1998).
F. Harary and E. Palmer, On Acyclic Simplicial Complexes, Mathematika 15 (1968), pp. 115 - 122.
F. Harary and E. Palmer, Graphical Enumeration, Academic Press, New York (1973), pp. 73 - 76.
J.W. Moon, Counting Labeled Trees, Canadian Mathematical Monographs, no. 1, (1970)
E. Palmer, On the Number of Labeled 2-Trees, Journal of Combinatorial Theory 6 (1969), pp. 206 - 207.
E. Palmer and R. Read, On the Number of Plane 2-Trees, J. London Mathematical Society 6 (1973), 583 - 592.
C. Rényi and A. Rényi, The Prüfer code for k-trees, Combinatorial theory and its applications, III (Proc. Colloq. Balatonfiired, 1969 ), pp. 945-971, North-Holland, Amsterdam, 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fowler, T., Gessel, I., Labelle, G., Leroux, P. (2000). Specifying 2-trees. In: Krob, D., Mikhalev, A.A., Mikhalev, A.V. (eds) Formal Power Series and Algebraic Combinatorics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04166-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-662-04166-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08662-5
Online ISBN: 978-3-662-04166-6
eBook Packages: Springer Book Archive