Graph Varieties Axiomatized by Semimedial, Medial, and Some Other Groupoid Identities

Directed graphs without multiple edges can be represented as algebras of type (2, 0), so-called graph algebras. A graph is said to satisfy an identity if the corresponding graph algebra does, and the set of all graphs satisfying a set of identities is called a graph variety. We describe the graph va...

Full description

Bibliographic Details
Main Authors: Lehtonen Erkko, Manyuen Chaowat
Format: Article
Language:English
Published: University of Zielona Góra 2020-12-01
Series:Discussiones Mathematicae - General Algebra and Applications
Subjects:
Online Access:https://doi.org/10.7151/dmgaa.1344

Similar Items