Graph algebra

This article is about the mathematical concept of Graph Algebras. For "Graph Algebra" as used in the social sciences, see Graph algebra (social sciences).

In mathematics, especially in the fields of universal algebra and graph theory, a graph algebra is a way of giving a directed graph an algebraic structure. It was introduced by McNulty and Shallon,^[1] and has seen many uses in the field of universal algebra since then.

Definition

Let D = (V, E) be a directed graph, and 0 an element not in V. The graph algebra associated with D has underlying set ${\displaystyle V\cup \{0\}}$, and is equipped with a multiplication defined by the rules

• xy = x if ${\displaystyle x,y\in V}$ and ${\displaystyle (x,y)\in E}$,
• xy = 0 if ${\displaystyle x,y\in V\cup \{0\}}$ and ${\displaystyle (x,y)\notin E}$.

Applications

This notion has made it possible to use the methods of graph theory in universal algebra and several other areas of discrete mathematics and computer science. Graph algebras have been used, for example, in constructions concerning dualities,^[2] equational theories,^[3] flatness,^[4] groupoid rings,^[5] topologies,^[6] varieties,^[7] finite-state machines,^[8][9] tree languages and tree automata,^[10] etc.

See also

• Group algebra (disambiguation)
• Incidence algebra
• Path algebra