An Algebraic Formalism for Graphs

We provide an algebraic structure for the set of finite graphs, whence a notion of graph expression for defining them and a complete set of equational rules for manipulating expressions.

[1]  Annegret Habel,et al.  On context-free gragh languages generated by edge replacement , 1982, Graph-Grammars and Their Application to Computer Science.

[2]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[3]  Jean-Claude Raoult,et al.  On graph rewritings , 1984, Bull. EATCS.

[4]  H. Kreowski,et al.  Pushout-Properties: An analysis of gluing constructions for graphs , 1979 .

[5]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..