Conflicting chip firing games on graphs and on trees

Conflicting chip firing games on graphs and on trees

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Pham, Tra An, Phan, Thi Ha Duong, Tran, Thi Thu Huong
Format: Article
Language:English
Published: VNU 2014
Subjects:
Chip Firing Game
Conflicting game,
Convergence
Discrete dynamical system
Evolution rule
Fxed point
Tree
Online Access:http://repository.vnu.edu.vn/handle/11126/4686
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Vietnam National University, Hanoi
Language: English
Description
Summary: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.

Similar Items