Random subtrees and unimodal sequences in graphs
From MaRDI portal
Recommendations
Cites work
- Alternating Whitney sums and matchings in trees. 1
- Extremal results on average subtree density of series-reduced trees
- Graph theory
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Indistinguishable trees and graphs
- Maximizing the mean subtree order
- Monotonicity of the mean order of subtrees
- On the average number of nodes in a subtree of a tree
- On the distribution of subtree orders of a tree
- On the local and global means of subtree orders
- On the maximum mean subtree order of trees
- On the mean subtree order of graphs under edge addition
- On the mean subtree order of trees under edge contraction
- On the probability that a random subtree is spanning
- Pick a Tree – Any Tree
- Subtrees of graphs
- The average order of a subtree of a tree
Cited in
(3)
This page was built for publication: Random subtrees and unimodal sequences in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080114)