Author:
Harary Frank,Palmer Edgar M.
Abstract
AbstractUsing arguments involving combinatorial enumeration and asymptotics we compute the probability that a point of a random tree is fixed. The method is also applied to homeomorphically irreducible trees to illustrate how it works for other species of trees. To the nearest per cent, the limiting probability of a fixed point in a randomtree is 70%, and for homeomorphically irreducible trees it is 20%.
Publisher
Cambridge University Press (CUP)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Symmetry in complex networks;Discrete Applied Mathematics;2008-11
2. Unsolved Problems in the Theory of Random Graphs;North-Holland Mathematics Studies;1987
3. Introduction;Graphs and Order;1985
4. Isomorphic factorizations VIII: Bisectable trees;Combinatorica;1984-06
5. A review of random graphs;Journal of Graph Theory;1982