On the Number of Nonisomorphic Subtrees of a Tree

DOI10.1002/jgt.22144zbMath1387.05044arXiv1601.00944OpenAlexW2963945724MaRDI QIDQ4604018

László A. Székely, Éva Czabarka, Stephan G. Wagner

Publication date: 23 February 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

treesextremal problemsubtreesnonisomorphic trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (5)

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ On the eccentric subtree number in trees ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Monotonicity of the mean order of subtrees
• Binary trees with the largest number of subtrees
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• On the Local Profiles of Trees
• On the Number of Subtrees of a Symmetricn-Ary Tree

This page was built for publication: On the Number of Nonisomorphic Subtrees of a Tree