October 1, 1978Open Access

On the Altitude of Nodes in Random Trees

Key Points

Key points are not available for this paper at this time.

Abstract

Let T n denote a tree with n nodes that is rooted at node r. (For definitions not given here see 4 or 10 .) The altitude of a node u in T n is the distance α = α (u, T n ) between r and u in T n . The width of T n at altitude is the number W k = W k (T n ) of nodes at altitude in T n , where = 0, 1, …

Bookmark

View Full Paper

Cite This Study

Meir et al. (Sun,) studied this question.

synapsesocial.com/papers/6a1de3e85c054b78c2ef8426 https://doi.org/https://doi.org/10.4153/cjm-1978-085-0

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Packing and covering constants for certain families of trees. I1977 · 21 citations
2The distance between points in random trees1970 · 43 citations
3Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen1937 · 1,017 citations
4On the Analytical Forms Called Trees1881 · 100 citations
5On the Distribution of the Number of Vertices in Strata of a Random Tree1969 · 27 citations

Bookmark

View Full Paper