Trees with large numbers of subtrees

DOI10.1080/00207160.2015.1109640MaRDI QIDQ5737871zbMATH OpenOpenAlexFDO

Authors

Publication date 30 May 2017

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2015.1109640

zbMATH Keywords

diameternetworknumber of subtreesreliability

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Enumeration in graph theory (05C30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Trees with the mos subtrees - an algorithmic approach
• Enumeration of subtrees of trees
• Enumeration of subtrees of planar two-tree networks
• The number of subtrees of trees with given diameter
• Largest Number of Subtrees of Trees with a Given Maximum Degree

Cites work

• A Characterization of Graphs of Diameter Two
• Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
• Binary trees with the largest number of subtrees
• Computing all subtree repeats in ordered 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
• Graph theory with applications
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• On subtrees of trees
• Optimally reliable graphs for both edge and vertex failures
• Optimally Reliable Graphs for Both Vertex and Edge Failures
• Superdominance order and distance of trees with bounded maximum degree
• The maximum agreement subtree problem
• The number of subtrees of trees with given degree sequence
• Trees with the mos subtrees - an algorithmic approach
• Unavoidable subtrees

Cited in

(14)

• On subtree number index of generalized book graphs, fan graphs, and wheel graphs
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Enumeration of subtrees of planar two-tree networks
• The expected subtree number index in random polyphenylene and spiro chains
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• On the number of connected subgraphs of graphs
• scientific article; zbMATH DE number 5016713 (Why is no real title available?)
• Large discrete parts of the E-tree
• The number of subtrees of trees with given diameter
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
• 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
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• Enumeration of subtrees of trees

This page was built for publication: Trees with large numbers of subtrees

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