The number of rounds needed to exchange information within a graph

In 3] Cederbaum proposes the problem of finding a labelling of a connected graph G which minimizes the number of rounds needed to exchange information between all the points, where a round consists of the vertices of G each broadcasting once in order of their labels. In this paper we give a complete solution to the problem.