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

DOI10.1016/J.TCS.2021.09.024MaRDI QIDQ2235776zbMATH OpenOpenAlexFDO

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

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

BC-subtreegenerating functionmaximum degreesubtree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Enumeration of BC-subtrees of trees
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• The number of subtrees of trees with given degree sequence
• Enumeration of constrained subtrees of trees
• The minimal number of subtrees with a given degree sequence
• Enumeration of K-trees and applications
• Enumeration of subtrees of trees
• scientific article; zbMATH DE number 644325
• On the enumeration of rooted trees with fixed size of maximal decreasing trees

Cites work

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

Cited in

(15)

• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Enumeration of subtrees of planar two-tree networks
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• Maximum number of subtrees in cacti and block graphs
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
• Enumeration of BC-subtrees of trees
• Enumeration of constrained subtrees of trees
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Subtrees, BC-subtrees of generalized Bethe trees and related questions.
• Constant time enumeration of bounded-size subtrees in trees and its application
• 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
• The subpath number of cactus graphs
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• Invitation to the subpath number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235776)