Pages that link to "Item:Q868393"

The following pages link to Binary trees with the largest number of subtrees (Q868393):

Displaying 30 items.

• Generating and enumerating digitally convex sets of trees (Q295254) (← links)
• The number of maximum matchings in a tree (Q409365) (← links)
• The minimal number of subtrees with a given degree sequence (Q489367) (← links)
• Extremal problems for trees with given segment sequence (Q507572) (← links)
• Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
• On the eccentric subtree number in trees (Q827611) (← links)
• On different ``middle parts'' of a tree (Q1658760) (← links)
• The shape of node reliability (Q1701111) (← links)
• On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
• Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
• Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
• Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees (Q2057597) (← links)
• Maximum number of subtrees in cacti and block graphs (Q2172841) (← links)
• The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
• The number of subtrees in graphs with given number of cut edges (Q2231772) (← links)
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
• On the number of connected subgraphs of graphs (Q2243091) (← links)
• Sub-trees of a random tree (Q2274085) (← links)
• Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
• Enumeration of BC-subtrees of trees (Q2344772) (← links)
• On \(\alpha \)-greedy expansions of numbers (Q2381829) (← links)
• Extremal values of ratios: distance problems vs. subtree problems in trees. II (Q2436831) (← links)
• The number of subtrees of trees with given diameter (Q4603866) (← links)
• On the Number of Nonisomorphic Subtrees of a Tree (Q4604018) (← links)
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
• The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
• Trees with large numbers of subtrees (Q5737871) (← links)
• Maximising the number of connected induced subgraphs of unicyclic graphs (Q5879474) (← links)
• Extremal problems for connected set enumeration (Q6094711) (← links)
• Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)