State clustering and declustering of 3-regular graphs with structural rewriting

Abstract

We consider a variant of graph developing system and show various behavior with one type of graph-rewriting. This system is based on rewriting of 3-regular graphs with two possible states per node. We focus on a simple case of fixed number of nodes. The development processes include interaction among rather stable subgraphs. Some simple behaviors, such as clustering and declustering of states, are shown by simulation. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.