The Total Acquisition Number of Random Graphs

[摘要] Let $G$ be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex $u$ to a neighbouring vertex $v$ can be moved, provided that the weight on $v$ is at least as large as the weight on $u$. The total acquisition number o

[学科分类] 离散数学和组合数学

[关键词] Random Graphs;Acquisition;Random Trees