On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree
From MaRDI portal
Publication:6606327
DOI10.1002/JGT.23128zbMATH Open1547.05052MaRDI QIDQ6606327
Feng Ming Dong, Zhuo Li, Xian'an Jin, Tianlong Ma
Publication date: 16 September 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Cites Work
- Extremal results on average subtree density of series-reduced trees
- Indistinguishable trees and graphs
- Monotonicity of the mean order of subtrees
- The average order of a subtree of a tree
- On the average number of nodes in a subtree of a tree
- On the maximum mean subtree order of trees
- On the Local and Global Means of Subtree Orders
- The mean order of sub‐k‐trees of k‐trees
- Maximizing the mean subtree order
- The number of labeled k-dimensional trees
- On the mean subtree order of trees under edge contraction
This page was built for publication: On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606327)
