The Unit Acquisition Number of Binomial Random Graphs

Konstantinos Georgiou, Somnath Kundu, Pawel Pralat

Let $G$ be a graph in which each vertex initially has weight 1. In each step, the unit weight from a vertex $u$ to a neighbouring vertex $v$ can be moved, provided that the weight…