Pages that link to "Item:Q1838491"
From MaRDI portal
The following pages link to On the average number of nodes in a subtree of a tree (Q1838491):
Displayed 34 items.
- Greedy trees, subtrees and antichains (Q396846) (← links)
- Extremal results on average subtree density of series-reduced trees (Q403359) (← links)
- Indistinguishable trees and graphs (Q489327) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- Monotonicity of the mean order of subtrees (Q796552) (← links)
- The average order of a subtree of a tree (Q965244) (← links)
- Alternating Whitney sums and matchings in trees. 1 (Q1105614) (← links)
- Graphs with only caterpillars as spanning trees (Q1415546) (← links)
- On different ``middle parts'' of a tree (Q1658760) (← 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)
- On the maximum mean subtree order of trees (Q2048363) (← links)
- On the average order of a dominating set of a forest (Q2092347) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- The path minimises the average size of a connected induced subgraph (Q2113349) (← links)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees (Q2169441) (← links)
- The average size of matchings in graphs (Q2175789) (← links)
- The average size of independent sets of graphs (Q2181915) (← links)
- The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- The average order of dominating sets of a graph (Q2231709) (← links)
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- A lower bound on the average size of a connected vertex set of a graph (Q2664553) (← links)
- When bad things happen to good trees (Q2744569) (← links)
- An Efficient Method of Examining all Trees (Q2785373) (← links)
- On the Local and Global Means of Subtree Orders (Q3466362) (← links)
- On the Number of Nonisomorphic Subtrees of a Tree (Q4604018) (← links)
- On the Mean Connected Induced Subgraph Order of Cographs (Q4616101) (← links)
- Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
- On the Mean Order of Connected Induced Subgraphs of Block Graphs (Q5109058) (← links)
- Central Limit Theorems for Additive Tree Parameters with Small Toll Functions (Q5364224) (← links)
- On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees (Q5737898) (← links)