Pages that link to "Item:Q489363"
From MaRDI portal
The following pages link to The minimal number of subtrees of a tree (Q489363):
Displayed 7 items.
- Eccentricity sums in trees (Q290112) (← links)
- Extremal problems for trees with given segment sequence (Q507572) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- The shape of node reliability (Q1701111) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- On the number of connected subgraphs of graphs (Q2243091) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)