On the mean subtree order of trees under edge contraction
From MaRDI portal
Publication:6046687
DOI10.1002/JGT.22885zbMATH Open1522.05037OpenAlexW4295242214MaRDI QIDQ6046687FDOQ6046687
Authors: Zuwen Luo, Kexiang Xu, Stephan Wagner, Hua Wang 
Publication date: 6 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-496935
Recommendations
Cites Work
- On subtrees of trees
- On the average number of nodes in a subtree of a tree
- Extremal results on average subtree density of series-reduced trees
- Monotonicity of the mean order of subtrees
- The average order of a subtree of a tree
- Indistinguishable trees and graphs
- On the local and global means of subtree orders
- Maximizing the mean subtree order
- On the maximum mean subtree order of trees
Cited In (14)
- Extremal results on average subtree density of series-reduced trees
- Decreasing the mean subtree order by adding k edges
- The average order of a subtree of a tree
- On the local and global means of subtree orders
- On the maximum mean subtree order of trees
- On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree
- Solution to a conjecture on the mean subtree order of graphs under edge addition
- Random subtrees and unimodal sequences in graphs
- On the difference of mean subtree orders under edge contraction
- On the mean order of connected induced subgraphs of block graphs
- On the mean subtree order of graphs under edge addition
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
- Title not available (Why is that?)
- Computing the number and average size of connected sets in planar 3-trees
This page was built for publication: On the mean subtree order of trees under edge contraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046687)
