2010•Unpublished venueRequires access
Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Graph Algebra of Type (2,0)
Montri Thongmoon, Tiang Poomsa-Ard
Open publisher page 0 citations
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 satisfles a term equation s … t if the corresponding graph algebra A(G) satisfles s … t. A class of graph algebras V is called a graph variety if V = Modg§ where § is a subset of T(X) £ T(X). A graph variety V 0 = Modg§ 0 is called a triregular leftmost without loop and reverse arc graph variety if § 0