Trees with large numbers of subtrees

DOI10.1080/00207160.2015.1109640zbMATH Open1362.05035OpenAlexW2321742174MaRDI QIDQ5737871

No author found.

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

networkreliabilitydiameternumber of subtrees

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Extremal results on average subtree density of series-reduced trees
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• On subtrees of trees
• Superdominance order and distance of trees with bounded maximum degree
• Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
• Trees with the mos subtrees - an algorithmic approach
• Computing all subtree repeats in ordered trees
• Unavoidable subtrees
• Extremal values of ratios: distance problems vs. subtree problems in trees. II
• The maximum agreement subtree problem
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Optimally reliable graphs for both edge and vertex failures
• A Characterization of Graphs of Diameter Two
• Optimally Reliable Graphs for Both Vertex and Edge Failures
• The Number of Subtrees of Trees with Given Degree Sequence

Related Items (11)

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ 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 ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ Unnamed Item ⋮ Large discrete parts of the E-tree ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On the number of connected subgraphs of graphs ⋮ 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

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