A finite complete set of equations generating graphs

Authors:
Symeon Bozapalidis;Antonios Kalampakas
Affiliations:
Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki, Greece;Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki, Greece
Venue:
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Year:
2003

Citing 6
Cited 0

On flowchart theories: part II. The nondeterministic case

Theoretical Computer Science
Towards a new algebraic foundation of flowchart scheme theory

Fundamenta Informaticae
A Kleene theorem for a class of planar acyclic graphs

Information and Computation
Network Algebra

Network Algebra
Span(Graph): A Categorial Algebra of Transition Systems

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
An Initial-Algebra Approach to Directed Acyclic Graphs

MPC '95 Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

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.