Hyperidentities in (xy)x ≈ X(yy) Graph Algebras of Type (2, 0) Hyperidentities in (xy)x ≈ X(yy) Graph Algebras of Type (2, 0)

Abstract

Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2, 0). We say that a graph G satisfies an identity s ≈ t if the corresponding graph algebra A(G) satisfies s ≈ t. A graph G = (V, E) is called an (xy)x ≈ x(yy) graph if the graph algebra A(G) satisfies the equation (xy)x ≈ x(yy). An… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics