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
L. E. Clarke, On Cayley's formula for counting trees, J. London Math. Soc. 33 (1958), 471–474.
F. Harary, Graph Theory, Addison-Wesley, Reading, 1969.
F. Harary and P. Ostrand, The cutting center theorem for trees, Discrete Math. 1 (1971), 7–18.
A. Meir and J. W. Moon, The distance between points in random trees, J. Combinatorial Theory 8 (1970), 99–103.
J. W. Moon, The expected number of inversions in a random tree, Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, 1970, 375–382.
J. W. Moon, Counting Labelled Trees, Canad. Math. Cong., Montreal, 1970.
J. W. Moon, Random walks on random trees, J. Aust. Math. Soc., to appear.
J. Riordan, Combinatorial Identities, Wiley, New York, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1972 Springer-Verlag
About this paper
Cite this paper
Moon, J.W. (1972). Two problems on random trees. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067372
Download citation
DOI: https://doi.org/10.1007/BFb0067372
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06096-3
Online ISBN: 978-3-540-38114-3
eBook Packages: Springer Book Archive