Please use this identifier to cite or link to this item:
Title: Conflicting chip firing games on graphs and on trees
Authors: Pham, Tra An
Phan, Thi Ha Duong
Tran, Thi Thu Huong
Keywords: Chip Firing Game;Conflicting game,;Convergence;Discrete dynamical system;Evolution rule;Fxed point;Tree
Issue Date: 2008
Publisher: VNU
Citation: p. 103-109
Abstract: Chip Firing Games on (directed) graph are widely used in theoretical computer science and many other sciences. In this model, chips are fired from one vertex to all of its neighbors at the same time. The purpose of our paper is to study an extended version of this model, the Conflicting Chip Firing Game, by considering that chips can be fired from one vertex to one of its neighbors at each time. Our main results are obtained when the support graph of this game is a rooted tree. In this case, we give the characterization of its reachable configurations and of its fixed points. Moreover we show the local lattice structure of its configuration space.
Appears in Collections:Natural Sciences and Technology

Files in This Item:

  • File : TC_02467.pdf
  • Description : 
  • Size : 194.76 kB
  • Format : Adobe PDF

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.