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

DOI10.1002/JGT.23128MaRDI QIDQ6606327zbMATH OpenFDO

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)

zbMATH Keywords

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

Mathematics Subject Classification ID

Trees (05C05)

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

Cites work

• Extremal results on average subtree density of series-reduced trees
• 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 local and global means of subtree orders
• On the maximum mean subtree order of trees
• On the mean subtree order of trees under edge contraction
• The average order of a subtree of a tree
• The mean order of sub-\(k\)-trees of \(k\)-trees
• The number of labeled k-dimensional trees

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)