The paper focuses on (communication) graph games. We propose an axiomatic characterization of the average tree solutions, first introduced by Herings, van der Laan and Talman (2008). We also discuss different average tree solutions in terms of the distribution of the Harsanyi dividends. Finally, computational issues are examined.