Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees

DOI10.1016/J.TCS.2021.09.024OpenAlexW3203853268MaRDI QIDQ2235776

Long Li, Yu Yang, Meng-yuan Jin, Hua Wang, Xiao Dong Zhang, Xiao-Xiao Li

Publication date: 21 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.024

zbMATH Keywords

generating functionmaximum degreesubtreeBC-subtree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Enumeration of subtrees of planar two-tree networks ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees

Cites Work

• Unnamed Item
• Unnamed Item
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Extremal results on average subtree density of series-reduced trees
• The minimal number of subtrees with a given degree sequence
• Subtrees of spiro and polyphenyl hexagonal chains
• Alternating Whitney sums and matchings in trees. II
• Monotonicity of the mean order of subtrees
• Enumeration of subtrees of trees
• Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
• Binary trees with the largest number of subtrees
• The average order of a subtree of a tree
• Chain hexagonal cacti: matchings and independent sets
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• Wiener indices of spiro and polyphenyl hexagonal chains
• The expected subtree number index in random polyphenylene and spiro chains
• Some extremal ratios of the distance and subtree problems in binary trees
• Enumeration of BC-subtrees of trees
• On the complexity of finding a largest common subtree of bounded degree
• Extremal values of ratios: distance problems vs. subtree problems in trees. II
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Subtrees of graphs
• The Number of Subtrees of Trees with Given Degree Sequence
• Correlation of Graph‐Theoretical Indices
• Trees with large numbers of subtrees
• On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees

This page was built for publication: Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees