On the maximum local mean order of sub-k-trees of a k-tree

DOI10.1002/JGT.23128zbMATH Open1547.05052MaRDI QIDQ6606327FDOQ6606327

Authors: Zhuo Li, Tianlong Ma, F. M. Dong, Xianan Jin 

Publication date: 16 September 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Recommendations

• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• Bounding mean orders of sub-\(k\)-trees of \(k\)-trees
• The mean order of sub-\(k\)-trees of \(k\)-trees
• On the local and global means of subtree orders
• On the maximum mean subtree order of trees

zbMATH Keywords

tree\(k\)-treeKelmans operationcharacteristic 1-treelocal mean order

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• The number of labeled k-dimensional 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
• The mean order of sub-\(k\)-trees of \(k\)-trees
• On the mean subtree order of trees under edge contraction

Cited In (1)

• Bounding mean orders of sub-\(k\)-trees of \(k\)-trees

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)