Learn More
In this paper we present further studies of recurrent configurations of Chip-firing games on Eule-rian directed graphs (simple digraphs), a class on the way from undirected graphs to general directed graphs. A computational problem that arises naturally from this model is to find the minimum number of chips of a recurrent configuration, which we call the(More)
  • 1