Skip to main content

Counting stable trees

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 403)

Keywords

  • Automorphism Group
  • Rooted Tree
  • Permutation Group
  • Dihedral Group
  • Symmetry Line

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. L. AUSTIN, R. E. FAGEN, W. F. PENNEY and J. RIORDAN, The number of components in random linear graphs. Ann. Math. Statist. 30 (1959), 747–754

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. W. BURNSIDE, Theory of Groups of Finite Order (second edition), Cambridge Univ. Press, Cambridge 1911.

    MATH  Google Scholar 

  3. F. HARARY, Graph Theory, Addison-Wesley, Reading, Mass. 1969.

    MATH  Google Scholar 

  4. F. HARARY and G. PRINS, The number of homeomorphically irreducible trees, and other species. Acta Math. 101 (1959), 141–162.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. D. A. HOLTON, A report on stable graphs. J. Aust. Math. Soc. 15 (1973), 163–171

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. D. A. HOLTON, Stable trees. J. Aust. Math. Soc. (to appear).

    Google Scholar 

  7. D. A. HOLTON, Two applications of semi-stability. Discrete Maths. 4 (1973), 151–158.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. D. A. KLARNER and N. G. deBRUIJN, Pattern Enumeration, in preparation.

    Google Scholar 

  9. K. L. McAVANEY, DOUGLAS D. GRANT, D. A. HOLTON, Stable and semi-stable unicyclic graphs. Submitted to J. Comb.Th.

    Google Scholar 

  10. K. L. McAVANEY and D. A. HOLTON, Enumeration of trees with particular automorphisms. Pure Maths. Preprint, Dept. Of Maths., Univ. of Melbourne.

    Google Scholar 

  11. R. OTTER, The number of trees. Ann. of Math. 49 (1948), 583–599.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. G. PÓLYA, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen and chemische Verbindungen. Acta Math. 68 (1937) 145–254.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. RONALD C. READ, Some recent results in chemical enumeration. Graph Theory and its Applications. Springer-Verlag, Lecture Notes in Maths. Vol. 303, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

McAvaney, K.L. (1974). Counting stable trees. In: Holton, D.A. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057379

Download citation

  • DOI: https://doi.org/10.1007/BFb0057379

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06903-4

  • Online ISBN: 978-3-540-37837-2

  • eBook Packages: Springer Book Archive