Abstract
It was known that every graph can be constructed from a finite list of elementary graphs using the operations of graph sum and graph composition. We determine a complete set of "equations" or rewriting rules with the property that two expressions represent the same graph if and only if one can be transformed into the other by means of these rules. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Bozapalidis, S., & Kalampakas, A. (2003). A finite complete set of equations generating graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2731, 118–128. https://doi.org/10.1007/3-540-45066-1_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
