Cutting down recursive trees
暂无分享,去创建一个
Abstract A recursive tree is constructed by starting with a source node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree could represent, for example, the spread of contamination from a single source within some organism. If we remove an edge from such a tree it falls into two subtrees one of which contains the source. If we continue to remove edges from the successively smaller subtrees that contain the source we eventually isolate the source. We consider how many randomly selected edges must be removed on the average before isolating the source by this procedure.
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] J. Moon. Counting labelled trees , 1970 .
[3] M. Tapia,et al. Generation of Concave Node-Weighted Trees , 1967, IEEE Transactions on Circuit Theory.
[4] A. Meir,et al. Cutting down random trees , 1970, Journal of the Australian Mathematical Society.
[5] Anatol Rapoport,et al. Distribution of nodes of a tree by degree , 1970 .