Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
Sensoria Bibliography Site A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
Fabio Gadducci
abstract:
Graphs with interfaces are a simple and intuitive tool for allowing a graph G to interact with the environment, by equipping it with two morphisms J → G, I → G. These “handles” were used to define graphical operators, and to provide an inductive presentation of graph rewriting. A main feature of graphs with interfaces is their characterization as terms of a free algebra. So far, this was possible only with discrete interfaces, i.e., containing no edge. This note shows that a similar free construction can be performed also with disconnected interfaces, i.e., containing only nodes connected to at most one edge.
