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...
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
-
A Kind of Variation Symmetry: Tarski Associative Groupoids (TA-Groupoids) and Tarski Associative Neutrosophic Extended Triplet Groupoids (TA-NET-Groupoids)
by: Xiaohong Zhang, et al.
Published: (2020-05-01) -
Two Open Problems on CA-Groupoids and Cancellativities of T2CA-Groupoids
by: Xiaogang An, et al.
Published: (2022-04-01) -
Undecidability of polynomial inequalities in weighted graph homomorphism densities
by: Grigoriy Blekherman, et al.
Published: (2024-01-01) -
REDUCED POWERS OF SOUSLIN TREES
by: ARI MEIR BRODSKY, et al.
Published: (2017-01-01) -
Some remarks on connectors and groupoids in Goursat categories
by: Marino Gran, et al.
Published: (2017-08-01)