The asymptotic value of the Randić index for trees

DOI10.1016/j.aam.2010.10.008zbMath1218.05035arXiv1003.4810OpenAlexW1636824039MaRDI QIDQ550268

Yi-Yang Li, Xue Liang Li

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

zbMATH Keywords

treegenerating functionnormal distributionasymptotic value(General) Randić indexaverage distancedouble-star

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Distance in graphs (05C12) Asymptotic enumeration (05A16) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree ⋮ The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: The asymptotic value of the Randić index for trees