The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree

DOI10.1016/j.jmaa.2015.09.007zbMath1325.05055arXiv1207.3915OpenAlexW1275724971MaRDI QIDQ890484

Xue Liang Li, Yongtang Shi, Yi-Yang Li

Publication date: 10 November 2015

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.3915

zbMATH Keywords

automorphismlimiting distributionpatternrooted treecounting, generating function

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Counting embeddings of rooted trees into families of rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic value of the Randić index for trees
• The distribution of degrees in a large random tree
• The expected number of symmetries in locally restricted trees. II
• The number of trees
• Vertices of degree k in random unlabeled trees
• Isomorphism and Symmetries in Random Phylogenetic Trees
• The distribution of nodes of given degree in random trees
• The Distribution of Patterns in Random Trees
• Nodes of large degree in random trees and forests

This page was built for publication: The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree