Bounding mean orders of sub-k-trees of k-trees

DOI10.37236/12426arXiv2309.16545MaRDI QIDQ6131736FDOQ6131736

Authors:

Publication date: 18 April 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.16545

Recommendations

• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree
• The mean order of sub-\(k\)-trees of \(k\)-trees
• On the local and global means of subtree orders
• On extremal sizes of locally \(k\)-tree graphs.

zbMATH Keywords

global mean ordermaximum local mean order

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited In (1)

• On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree

This page was built for publication: Bounding mean orders of sub-\(k\)-trees of \(k\)-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131736)