No polynomial bound for the period of the parallel chip firing game on graphs

M. A. Kiwi, R. Ndoundam, M. Tchuente, E. Goles

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

The following (solitaire) game is considered: Initially each node of a simple, connected, finite graph contains a finite number of chips. A move consists in firing all nodes with at least as many chips as their degree, where firing a node corresponds to sending one of the node's chips to each one of the node's neighbors.

Original languageEnglish
Pages (from-to)527-532
Number of pages6
JournalTheoretical Computer Science
Volume136
Issue number2
DOIs
StatePublished - 26 Dec 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'No polynomial bound for the period of the parallel chip firing game on graphs'. Together they form a unique fingerprint.

Cite this