Pages that link to "Item:Q3394983"
From MaRDI portal
The following pages link to Largest Number of Subtrees of Trees with a Given Maximum Degree (Q3394983):
Displayed 28 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree (Q266078) (← links)
- The number of maximum matchings in a tree (Q409365) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- The sum of the distances between the leaves of a tree and the `semi-regular' property (Q539876) (← links)
- On the number of independent subsets in trees with restricted degrees (Q552058) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- On the eccentric subtree number in trees (Q827611) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← 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)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← 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)
- Extremal trees with fixed degree sequence (Q2223451) (← 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)
- The number of subtrees of trees with given diameter (Q4603866) (← links)
- The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
- Trees with large numbers of subtrees (Q5737871) (← 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)