Advanced Search

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 a term equation s ≈ t if the corresponding graph algebra $\underline{A\left(G\right)}$ satisfies s ≈ t. A class of graph algebras V is called a graph variety if $V=Mo{d}_g\Sigma$ where Σ is a subset of T(X) × T(X). A graph variety $V^{\text{'}}=Mo{d}_g{\Sigma }^{\text{'}}$ is called a biregular leftmost graph variety if Σ’ is a set of biregular leftmost term equations. A term equation s ≈ t is called an identity in a variety...