Skip to main content
SpringerLink
Log in

Counting genealogical trees

  • Published:
Journal of Mathematical Biology Aims and scope Submit manuscript

Abstract

A class of genealogical trees is related to unlabelled graph-theoretical trees, allowing some counting problems involved with genealogical trees to be solved.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ethier, S. N., Griffiths, R. C.: The infinitely-many-sites model as a measure-valued diffusion. To appear in Ann. Prob. (1987)

  • Harary, F.: Graph theory. London: Addison-Wesley 1972

    Google Scholar 

  • Nijenhuis, A., Wilf, H. S.: Combinatorial algorithms, 2nd edn. New York: Academic Press (1978)

    Google Scholar 

  • Watterson, G. A.: On the number of segregating sites in genetic models without recombination. Theor. Popul. Biol. 7, 256–276 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Monash University, 3168, Clayton, Victoria, Australia

    R. C. Griffiths

Authors
  1. R. C. Griffiths
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Griffiths, R.C. Counting genealogical trees. J. Math. Biology 25, 423–431 (1987). https://doi.org/10.1007/BF00277166

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation