2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/165906We undertake the first study of the candy-passing game on arbitrary connected graphs. We obtain a general stabilization result which encompasses the first author's results (arXiv:0709.2156) for candy-passing games on n-cycles with at least 3n candies.2 pagesCombinatoricsDiscrete Mathematics05C35 (Primary); 37B15 (Secondary)text