Pages that link to "Item:Q489367"

The following pages link to The minimal number of subtrees with a given degree sequence (Q489367):

Displaying 20 items.

• Eccentricity sums in trees (Q290112) (← links)
• The minimal number of subtrees of a tree (Q489363) (← links)
• Extremal problems for trees with given segment sequence (Q507572) (← links)
• Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
• The distances between internal vertices and leaves of a tree (Q740265) (← links)
• Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
• The shape of node reliability (Q1701111) (← links)
• Trees with given stability number and minimum number of stable sets (Q1926055) (← links)
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
• The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
• On the roots of the subtree polynomial (Q2198997) (← 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)
• On majorization of closed walk vectors of trees with given degree sequences (Q2335614) (← links)
• The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
• Subforests of bipartite digraphs---the minimum degree condition (Q5959113) (← links)
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices (Q6064850) (← links)
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
• Extremal problems for connected set enumeration (Q6094711) (← links)