Skip to main content

Enumération des 2-arbres k-gonaux

  • Conference paper
Mathematics and Computer Science II

Part of the book series: Trends in Mathematics ((TM))

Résumé

In this paper1, we generalize 2-trees by replacing triangles by quadrilaterals, pentagons or k-sided polygons (k-gons), where k ≥ 3 is given. This generalization, to k-gonal 2-trees, is natural and is closely related, in the planar case, to some specializations of the cell-growth problem. Our goal is the enumeration, labelled and unlabelled, of k-gonal 2-trees according to the number n of k-gons. Wegive explicit formulas in the labelled case, and, in the unlabelled case, recursive and asymptotic formulas.

Article Footnote

Avec l’appui du FCAR (Québec) et du CRSNG (Canada)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bergeron, G. Labelle, and P. Leroux Combinatorial Species and tree-like structures Encyclopedia of Mathematics and it’s Applications, vol. 67, Cambridge University Press, (1998).

    MATH  Google Scholar 

  2. T. Fowler, I. Gessel, G. Labelle, P. Leroux Specifying 2-trees Proceedings FPSAC’01, Moscou, 26–30 juin 2000, 202–213.

    Google Scholar 

  3. T. Fowler, I. Gessel, G. Labelle, P. Leroux The Specification of 2-trees Advances in Applied Mathematics, 28, 145–168, (2002).

    Article  MathSciNet  MATH  Google Scholar 

  4. F. Harary and E. Palmer Graphical Enumeration Academic Press, New York, (1973).

    MATH  Google Scholar 

  5. F. Harary, E. Palmer and R. Read On the cell-growth problem for arbitrary polygons Discrete Mathematics, 11, 371–389, (1975).

    Article  MathSciNet  MATH  Google Scholar 

  6. INRIA Encyclopedia of combinatorial structures. http://algo.inria.fr/encyclopedia/index.html.

  7. G. Labelle Some new computational methods in the theory of species Combinatoire énumérative, Proceedings, Montréal, Québec, Lectures Notes in Mathematics, vol. 1234, Springer-Verlag, New-York/Berlin, 160–176, (1985).

    Google Scholar 

  8. G. Labelle, C. Lamathe and P. Leroux Développement moléculaire de l’espèce des 2-arbres planaires Proceedings GASCom01, 41–46, (2001).

    Google Scholar 

  9. G. Labelle, C. Lamathe and P. Leroux A classification of plane and planar 2-trees preprint CO/0202052, submitted.

    Google Scholar 

  10. R. Otter The number of trees Annals of Mathematics, 49, 583–599, (1948).

    Article  MathSciNet  MATH  Google Scholar 

  11. N. J. A. Sloane and S. Plouffe The Encyclopedia of Integer Sequences Academic Press, San Diego, (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Basel AG

About this paper

Cite this paper

Labelle, G., Lamathe, C., Leroux, P. (2002). Enumération des 2-arbres k-gonaux. In: Chauvin, B., Flajolet, P., Gardy, D., Mokkadem, A. (eds) Mathematics and Computer Science II. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8211-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8211-8_6

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9475-3

  • Online ISBN: 978-3-0348-8211-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics