The asymptotic value of the Randić index for trees
DOI10.1016/j.aam.2010.10.008zbMath1218.05035arXiv1003.4810MaRDI QIDQ550268
Publication date: 8 July 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.4810
tree; generating function; normal distribution; asymptotic value; (General) Randić index; average distance; double-star
05C05: Trees
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05C12: Distance in graphs
05A16: Asymptotic enumeration
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Related Items
Uses Software
Cites Work
- On conjectures of Graffiti
- The distribution of degrees in a large random tree
- The number of trees
- On the Asymptotic Behavior of Degrees of Vertices in a Random Graph
- The distribution of nodes of given degree in random trees
- Paths in graphs
- The Distribution of Patterns in Random Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item