The following pages link to Enumeration of subtrees of trees (Q861266):
Displaying 32 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- Greedy trees, subtrees and antichains (Q396846) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- On the eccentric subtree number in trees (Q827611) (← links)
- The shape of node reliability (Q1701111) (← links)
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs (Q2035665) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- The average size of a connected vertex set of a \(k\)-connected graph (Q2043391) (← 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)
- Enumeration of subtrees of planar two-tree networks (Q2168574) (← links)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees (Q2169441) (← 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)
- On the roots of the subtree polynomial (Q2198997) (← 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)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- A lower bound on the average size of a connected vertex set of a graph (Q2664553) (← 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)
- On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees (Q5737898) (← links)
- The average size of a connected vertex set of a graph—Explicit formulas and open problems (Q6055930) (← 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)
- Models of random subtrees of a graph (Q6183888) (← links)
