Binary trees with the largest number of subtrees
From MaRDI portal
(Redirected from Publication:868393)
Recommendations
Cites work
- scientific article; zbMATH DE number 5016713 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- On -greedy expansions of numbers
- On subtrees of trees
- Superdominance order and distance of trees with bounded maximum degree
- Wiener index versus maximum degree in trees
Cited in
(46)- On different ``middle parts of a tree
- The shape of node reliability
- On subtrees of trees
- Further analysis on the total number of subtrees of trees
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees
- Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost
- Cut and pendant vertices and the number of connected induced subgraphs of a graph
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
- Maximum number of subtrees in cacti and block graphs
- The expected subtree number index in random polyphenylene and spiro chains
- The number of subtrees in graphs with given number of cut edges
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- On the number of connected subgraphs of graphs
- Sub-trees of a random tree
- Some extremal ratios of the distance and subtree problems in binary trees
- Enumeration of BC-subtrees of trees
- On -greedy expansions of numbers
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Generating and enumerating digitally convex sets of trees
- scientific article; zbMATH DE number 5016713 (Why is no real title available?)
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- The number of maximum matchings in a tree
- The number of subtrees of trees with given diameter
- On the number of nonisomorphic subtrees of a tree
- The minimal number of subtrees with a given degree sequence
- Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
- Extremal problems for trees with given segment sequence
- The number of subtrees of trees with given degree sequence
- Trees with large numbers of subtrees
- The Maximum Binary Tree Problem.
- Maximising the number of connected induced subgraphs of unicyclic graphs
- Extremal problems for connected set enumeration
- Computing the number and average size of connected sets in planar 3-trees
- Subtrees of spiro and polyphenyl hexagonal chains
- Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs
- The subpath number of cactus graphs
- Binary trees with extremal number of maximal independent sets
- The number of dominating sets in d-ary trees
- Invitation to the subpath number
- Paired-domination in binary trees
- The number of total dominating sets in binary trees
- Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs
- Subtree number versus Wiener index
- A sharp upper bound for the number of connected sets in any grid graph
- Counting geodesic paths in graphs
- On the eccentric subtree number in trees
This page was built for publication: Binary trees with the largest number of subtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868393)
