Random subtrees and unimodal sequences in graphs

DOI10.1016/j.disc.2023.113654zbMath1525.05173OpenAlexW4385962474MaRDI QIDQ6080114

Kexiang Xu, Jing Tian, Zuwen Luo

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113654

zbMATH Keywords

complete graphunimodal sequencerandom subtree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Alternating Whitney sums and matchings in trees. 1
• On the average number of nodes in a subtree of a tree
• On the maximum mean subtree order of trees
• On the distribution of subtree orders of a tree
• Pick a Tree – Any Tree
• On the Local and Global Means of Subtree Orders
• Subtrees of graphs
• Maximizing the mean subtree order
• On the mean subtree order of trees under edge contraction
• On the mean subtree order of graphs under edge addition
• On the probability that a random subtree is spanning

This page was built for publication: Random subtrees and unimodal sequences in graphs