The distribution of degrees in a large random tree
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3152798 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Parallel concepts in graph theory
- The number of homeomorphically irreducible trees, and other species
- The number of trees
Cited in
(34)- The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees
- Isomorphic factorizations VIII: Bisectable trees
- The shape of unlabeled rooted random trees
- Topological phases: an expedition off lattice
- Hereditarily finite sets and identity trees
- Decomposing almost complete graphs by random trees
- On the average number of nodes in a subtree of a tree
- Fast random generation of binary, t-ary and other types of trees
- An asymptotic analysis of labeled and unlabeled k-trees
- The probability that a point of a tree is fixed
- The asymptotic value of the Randić index for trees
- The Distribution of Patterns in Random Trees
- On the number of trees in a random forest
- Central limit theorems for additive tree parameters with small toll functions
- The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
- Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
- An asymptotic evaluation of the cycle index of a symmetric group
- The degree profile of random Pólya trees
- Counting graceful labelings of trees: a theoretical and empirical study
- The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.
- Parameter estimation in a 3‐parameter p‐star random graph model
- Belated analyses of three credit-based adaptive polling algorithms
- Counting and coding identity trees with fixed diameter and bounded degree
- Survey sampling in graphs
- On an asymptotic evaluation of the cycle index of the symmetric group
- The Harmonious Chromatic Number of Almost All Trees
- An efficient method of examining all trees
- Linear time tree codes
- The generation of random, binary unordered trees
- Decomposing almost complete graphs by random trees
- Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
- Counting embeddings of rooted trees into families of rooted trees
- Vertices of degree \(k\) in random unlabeled trees
- Vertices of degree \(k\) in random unlabeled trees
This page was built for publication: The distribution of degrees in a large random tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1218434)
