Pages that link to "Item:Q2436831"
From MaRDI portal
The following pages link to Extremal values of ratios: distance problems vs. subtree problems in trees. II (Q2436831):
Displayed 9 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- Eccentricity sums in trees (Q290112) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- On the eccentric subtree number in trees (Q827611) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
- The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- Trees with large numbers of subtrees (Q5737871) (← links)
- On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees (Q5737898) (← links)