INFELD , Ewa

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 of G, denoted by a_t(G), is the minimum cardinality of the set of vertices with positive weight at the...