The Total Acquisition Number of Random Graphs

Electronic Journal Of Combinatorics

Deepak Bal¹ 

关键词: Random Graphs;    Acquisition;    Random Trees;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others