Graph varieties axiomatized by semimedial, medial, and some other groupoid identities

Erkko Lehtonen, Chaowat Manyuen

Research output: Contribution to journalArticlepeer-review

Abstract

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 varieties axiomatized by certain groupoid identities (medial, semimedial, autodistributive, commutative, idempotent, unipotent, zeropotent, alternative).

Original languageBritish English
Pages (from-to)143-157
Number of pages15
JournalDiscussiones Mathematicae - General Algebra and Applications
Volume40
Issue number2
DOIs
StatePublished - 1 Dec 2020

Keywords

  • Graph algebra
  • Groupoid
  • Identities
  • Mediality
  • Semimediality

Fingerprint

Dive into the research topics of 'Graph varieties axiomatized by semimedial, medial, and some other groupoid identities'. Together they form a unique fingerprint.

Cite this